Sciweavers

13784 search results - page 2257 / 2757
» On Computing Functions with Uncertainty
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
196
Voted
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
16 years 7 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
OSDI
2006
ACM
16 years 7 months ago
Ceph: A Scalable, High-Performance Distributed File System
We have developed Ceph, a distributed file system that provides excellent performance, reliability, and scalability. Ceph maximizes the separation between data and metadata manage...
Sage A. Weil, Scott A. Brandt, Ethan L. Miller, Da...
OSDI
2002
ACM
16 years 7 months ago
FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides ...
Atul Adya, William J. Bolosky, Miguel Castro, Gera...
« Prev « First page 2257 / 2757 Last » Next »