Sciweavers

3208 search results - page 272 / 642
» A Lower Bound for Primality
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 6 months ago
Buffering in query evaluation over XML streams
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
VTC
2008
IEEE
16 years 1 months ago
High Rate Two-Way Amplify-and-Forward Half-Duplex Relaying with OSTBC
—In this paper, we derive tight upper and lower bounds for the average sum rate of two-way amplify-andforward (AF) half-duplex relaying, which show that two-way AF half-duplex re...
Yang Han, See Ho Ting, Chin Keong Ho, Woon Hau Chi...
LATIN
2004
Springer
16 years 22 hour ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
MFCS
2004
Springer
16 years 21 hour ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick