Sciweavers

1261 search results - page 101 / 253
» Approximation algorithms for aligning points
Sort
View
ICASSP
2010
IEEE
14 years 10 months ago
Partial sequence matching using an Unbounded Dynamic Time Warping algorithm
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
Xavier Anguera, Robert Macrae, Nuria Oliver
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
JCSS
2011
95views more  JCSS 2011»
14 years 4 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger
MICAI
2004
Springer
15 years 3 months ago
An Improved ICP Algorithm Based on the Sensor Projection for Automatic 3D Registration
Three-dimensional (3D) registration is the process aligning the range data sets form different views in a common coordinate system. In order to generate a complete 3D model, we nee...
Sang-Hoon Kim, Yong Ho Hwang, Hyun-Ki Hong, Min-Hy...
AIMSA
2010
Springer
14 years 11 months ago
Expressive Approximations in DL-Lite Ontologies
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...