Sciweavers

2252 search results - page 66 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
RSA
2008
85views more  RSA 2008»
13 years 7 months ago
On a universal best choice algorithm for partially ordered sets
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
Nicholas Georgiou, Malgorzata Kuchta, Michal Moray...
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
14 years 1 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 7 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
PAMI
2006
146views more  PAMI 2006»
13 years 7 months ago
Attention-Based Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Bounds
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
Tamar Avraham, Michael Lindenbaum
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 2 months ago
A Delay-Bounded Dynamic Interactive Power Control Algorithm for VANETs
— To enable real-time and robust message delivery, the highly mobile Vehicular Ad Hoc Networks (VANETs) call for comprehensive investigation on the dynamic power control effects ...
Chunxiao Chigan, Jialiang Li