Sciweavers

2899 search results - page 75 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
14 years 1 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro
CDC
2008
IEEE
168views Control Systems» more  CDC 2008»
15 years 8 months ago
An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
Rafael Fierro, Silvia Ferrari, Chenghui Cai
CGF
2004
144views more  CGF 2004»
15 years 1 months ago
Crowd of Virtual Humans: a New Approach for Real Time Navigation in Complex and Structured Environments
The navigation activity is an every day practice for any human being capable of locomotion. Our objective in this work is to reproduce this crucial human activity inside virtual e...
Fabrice Lamarche, Stéphane Donikian
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
15 years 5 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf
SPAA
2010
ACM
15 years 1 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis