Sciweavers

FOCS
2000
IEEE
14 years 1 days ago
Clustering Data Streams
The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis o...
Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan ...
FOCS
2000
IEEE
14 years 1 days ago
Hierarchical Placement and Network Design Problems
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
Sudipto Guha, Adam Meyerson, Kamesh Munagala
FOCS
2000
IEEE
14 years 1 days ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
FOCS
2000
IEEE
14 years 1 days ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
FOCS
2000
IEEE
14 years 1 days ago
A polylogarithmic approximation of the minimum bisection
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
Uriel Feige, Robert Krauthgamer
FOCS
2000
IEEE
14 years 1 days ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard
FOCS
2000
IEEE
14 years 1 days ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
FOCS
2000
IEEE
14 years 1 days ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
FOCS
2000
IEEE
14 years 1 days ago
Cache-Oblivious B-Trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...