562 search results - page 41 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
103
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
142
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Traditional image retrieval methods require a "query image" to initiate a search for members of an image category. However, when the image database is unstructured, and ...
146
click to vote
ESA
2011
Springer
14 years 1 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
100
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
102
click to vote
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...