Sciweavers

3208 search results - page 142 / 642
» A Lower Bound for Primality
Sort
View
EUROPAR
2005
Springer
15 years 12 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
15 years 10 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
IPCO
1993
98views Optimization» more  IPCO 1993»
15 years 7 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
AMW
2009
15 years 7 months ago
Data Expiration and Aggregate Queries
We investigate the space requirements for summaries needed for maintaining exact answers to aggregate queries over histories of relational databases. We show that, in general, a su...
David Toman
JACM
2006
146views more  JACM 2006»
15 years 6 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman