Sciweavers

1632 search results - page 43 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
164
Voted
PODC
2006
ACM
15 years 9 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
EMO
2003
Springer
86views Optimization» more  EMO 2003»
15 years 8 months ago
No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
David Corne, Joshua D. Knowles
149
Voted
CCCG
2009
15 years 4 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
RTCSA
2000
IEEE
15 years 7 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas
ECCV
2006
Springer
16 years 5 months ago
Aligning Sequences and Actions by Maximizing Space-Time Correlations
Abstract. We introduced an algorithm for sequence alignment, based on maximizing local space-time correlations. Our algorithm aligns sequences of the same action performed at diffe...
Yaron Ukrainitz, Michal Irani