Sciweavers

389 search results - page 59 / 78
» Optimal Information Propagation in Sensor Networks
Sort
View
SDM
2012
SIAM
238views Data Mining» more  SDM 2012»
12 years 12 months ago
Evaluating Event Credibility on Twitter
Though Twitter acts as a realtime news source with people acting as sensors and sending event updates from all over the world, rumors spread via Twitter have been noted to cause c...
Manish Gupta, Peixiang Zhao, Jiawei Han
115
Voted
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
14 years 9 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
WWW
2007
ACM
15 years 10 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham
GLOBECOM
2007
IEEE
15 years 3 months ago
Relay Selection for Low-Complexity Coded Cooperation
— This paper explores relay selection and selection diversity for coded cooperation in wireless sensor networks, with complexity constraints for the sensor nodes. In previous wor...
Josephine P. K. Chu, Raviraj S. Adve, Andrew W. Ec...
116
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve