Sciweavers

64 search results - page 6 / 13
» First Order Random Forests with Complex Aggregates
Sort
View
112
Voted
PODS
2005
ACM
211views Database» more  PODS 2005»
15 years 9 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
TWC
2008
133views more  TWC 2008»
14 years 9 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
TMC
2008
127views more  TMC 2008»
14 years 9 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
84
Voted
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 2 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 4 months ago
Exploiting Temporal Complex Network Metrics in Mobile Malware Containment
Malicious mobile phone worms spread between devices via short-range Bluetooth contacts, similar to the propagation of human and other biological viruses. Recent work has employed m...
John Tang, Cecilia Mascolo, Mirco Musolesi, Vito L...