269 search results - page 7 / 54 » Optimal Randomized Algorithms for Local Sorting and Set-Maxi... |
AI
1999
Springer
13 years 7 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
NIPS
2008
13 years 9 months ago
2008
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
JAL
2002
13 years 7 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
WEA
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...