562 search results - page 38 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
101
click to vote
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
EMO
2001
Springer
15 years 2 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
CCR
2005
14 years 9 months ago
2005
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
MVA
1990
14 years 11 months ago
1990
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...