Sciweavers

16188 search results - page 3082 / 3238
» The Optimal PAC Algorithm
Sort
View
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
16 years 6 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
16 years 6 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 6 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
EDBT
2004
ACM
122views Database» more  EDBT 2004»
16 years 6 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
EDBT
2006
ACM
190views Database» more  EDBT 2006»
16 years 6 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...
« Prev « First page 3082 / 3238 Last » Next »