7930 search results - page 458 / 1586 » Greedy in Approximation Algorithms |
149
click to vote
ICRA
2006
IEEE
16 years 28 days ago
2006
IEEE
– The paper deals with fitting of planar patches to 3D laser range data obtained by a mobile robot. The number and the initial position of the patches are unknown, hence their es...
193
click to vote
PPSN
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
205
click to vote
SPIRE
1998
Springer
15 years 11 months ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
146
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
175
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...