Sciweavers

606 search results - page 89 / 122
» Memory-constrained aggregate computation over data streams
Sort
View
99
Voted
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 3 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
131
Voted
MOBISYS
2005
ACM
16 years 3 months ago
Horde: separating network striping policy from mechanism
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
Asfandyar Qureshi, John V. Guttag
214
Voted
CVPR
2012
IEEE
13 years 9 months ago
Stream-based Joint Exploration-Exploitation Active Learning
Learning from streams of evolving and unbounded data is an important problem, for example in visual surveillance or internet scale data. For such large and evolving real-world data...
Chen Change Loy, Timothy M. Hospedales, Tao Xiang,...
151
Voted
ICC
2007
IEEE
15 years 10 months ago
PERD: Polynomial-based Event Region Detection in Wireless Sensor Networks
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
Torsha Banerjee, Demin Wang, Bin Xie, Dharma P. Ag...
210
Voted
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 3 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...