Sciweavers

1046 search results - page 46 / 210
» Approximation Algorithms for Domination Search
Sort
View
TEC
2008
150views more  TEC 2008»
15 years 10 days ago
AbYSS: Adapting Scatter Search to Multiobjective Optimization
We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to...
Antonio J. Nebro, Francisco Luna, Enrique Alba, Be...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 10 days ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
GIS
2002
ACM
15 years 6 days ago
Search algorithms for multiway spatial joins
This papers deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) the...
Dimitris Papadias, Dinos Arkoumanis
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
Jiann-Der Lee, Shih-Sen Hsieh, Chung-Hsien Huang, ...
98
Voted
ICPR
2008
IEEE
15 years 6 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov