Sciweavers

33 search results - page 5 / 7
» Approximate Halfspace Range Counting
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ADC
2010
Springer
266views Database» more  ADC 2010»
13 years 2 months ago
Counting distinct objects over sliding windows
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, X...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 8 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
ICDE
2004
IEEE
140views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Aggregation Techniques for Sensor Databases
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
Jeffrey Considine, Feifei Li, George Kollios, John...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet