Sciweavers

6028 search results - page 1088 / 1206
» Randomness as a resource for design
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 6 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 6 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 6 months ago
Processing complex aggregate queries over data streams
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) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
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,...
MOBIHOC
2008
ACM
16 years 6 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
« Prev « First page 1088 / 1206 Last » Next »