Buscar
Mostrando ítems 31-40 de 858
Delaunay based algorithm for finding polygonal voids in planar point sets
(Elsevier, 2018)
This paper presents a new algorithm to find under-dense regions called voids inside a 2D point set. The
algorithm starts from terminal-edges (local longest-edges) in a Delaunay triangulation and builds the
largest possible ...
Fixed-Parameter approximation schemes for weighted flowtime
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018)
Given a set of n jobs with integral release dates, processing times and weights, it is a natural and
important scheduling problem to compute a schedule that minimizes the sum of the weighted flow
times of the jobs. There ...
On the improvement of positioning accuracy in WiFi-based wireless network using correntropy-based kernel learning algorithms
(Wiley Blackwell, 2019)
Currently, we have witnessed the rapid development of data-driven machine learning methods, which have achieved very effective results in communication systems. Kernel learning is a typical nonlinear learning method in the ...
Computing coverage kernels under restricted settings
(Springer Verlag, 2018)
We consider the Minimum Coverage Kernel problem: given a set B of d-dimensional boxes, find a subset of B of minimum size covering the same region as B. This problem is NP -hard, but as for many NP -hard problems on graphs, ...
Complexity of splits reconstruction for low-degree trees
(Elsevier, 2015)
Given a vertex-weighted tree T , the split of an edge e in T is the minimum over the weights
of the two trees obtained by removing e from T , where the weight of a tree is the sum of
weights of its vertices. Given a set ...
Depth distribution in high dimensions
(Springer, 2017)
Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set mathcal {B} of axis aligned boxes, whose computation generalizes that of the Klee’s Measure and of ...
A guided tour to approximate string matching
(ASSOC COMPUTING MACHINERY, 2001)
We survey the current techniques to cope with the problem of string matching that allows errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational ...
Mate selection in aquaculture breeding using differential evolution algorithm
(Wiley, 2017)
An algorithm to perform mate selection in aquaculture breeding using a computational optimization procedure called "differential evolution" (DE) was applied under optimum contribution selection and mate selection scenarios, ...
COMPUTATIONAL STUDY on the RUPTURE RISK in REAL CEREBRAL ANEURYSMS with GEOMETRICAL and FLUID-MECHANICAL PARAMETERS USING FSI SIMULATIONS and MACHINE LEARNING ALGORITHMS
(World Scientific Publishing Co. Pte Ltd, 2019)
Fluid-mechanical and morphological parameters are recognized as major factors in the rupture risk of human aneurysms. On the other hand, it is well known that a lot of machine learning tools are available to study a variety ...
SoIoT: Toward A User-Centric IoT-Based Service Framework
(Assoc Computing Machinery, 2016)
An emerging issue in urban computing environments is the seamless selection, composition, and delivery of user-centric services that run over what is known as the Internet of Things (IoT). This challenge is about enabling ...