Sciweavers

3247 search results - page 632 / 650
» Randomized smoothing networks
Sort
View
EDBT
2006
ACM
190views Database» more  EDBT 2006»
15 years 9 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
ICDCS
2009
IEEE
15 years 6 months ago
A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems
In distributed storage systems, erasure codes represent an attractive solution to add redundancy to stored data while limiting the storage overhead. They are able to provide the s...
Alessandro Duminuco, Ernst W. Biersack
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 6 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
HICSS
2010
IEEE
161views Biometrics» more  HICSS 2010»
15 years 4 months ago
Managing Information Intensive Service Facilities: Executive Contracts, Market Information, and Capacity Planning
in Progress – Extended Abstract Word count: 3124 Effectively managing IT service centers such as call centers, computerized diagnostic imaging facilities, data centers, e-commerc...
Yabing Jiang, Abraham Seidmann
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen