Sciweavers

4131 search results - page 549 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 7 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
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
SIGMOD
2008
ACM
129views Database» more  SIGMOD 2008»
16 years 7 months ago
An xml index advisor for DB2
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
DCC
2008
IEEE
16 years 6 months ago
Distributed Multi-stage Coding of Correlated Sources
This paper considers the problem of distributed scalable coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
Ankur Saxena, Kenneth Rose
ICDT
2010
ACM
259views Database» more  ICDT 2010»
16 years 4 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira