Sciweavers

5580 search results - page 340 / 1116
» Randomized priority algorithms
Sort
View
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
15 years 9 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
Lukasz Kowalik, Marcin Mucha
156
Voted
ECCV
2008
Springer
16 years 9 months ago
Robust Multiple Structures Estimation with J-Linkage
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
Roberto Toldo, Andrea Fusiello
ICASSP
2009
IEEE
16 years 1 months ago
On ICA of improper and noncircular sources
We provide a review of independent component analysis (ICA) for complex-valued improper and noncircular random sources. An improper random signal is correlated with its complex co...
Peter J. Schreier, Tülay Adali, Louis L. Scha...
CIE
2009
Springer
16 years 1 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
16 years 1 months ago
DCMA: yet another derandomization in covariance-matrix-adaptation
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...
Olivier Teytaud, Sylvain Gelly