Sciweavers

2412 search results - page 229 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 9 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
EDBTW
2004
Springer
15 years 9 months ago
Index-Based Keyword Search in Mediator Systems
Many users and applications require the integration of semi-structured data from autonomous, heterogeneous Web sources. Over the last years mediator systems have emerged that use d...
Ingolf Geist
EVOW
1994
Springer
15 years 8 months ago
Competitive Evolution: A Natural Approach to Operator Selection
One of the main problems in applying evolutionary optimisation methods is the choice of operators and parameter values. This paper propose a competitive evolution method, in which ...
Q. Tuan Pham
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
15 years 3 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
RTA
2005
Springer
15 years 9 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen