Sciweavers

1640 search results - page 230 / 328
» Conditional Independence Trees
Sort
View
SIGMOD
2005
ACM
106views Database» more  SIGMOD 2005»
14 years 9 months ago
Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique s...
Amit Manjhi, Suman Nath, Phillip B. Gibbons
IPSN
2010
Springer
14 years 3 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 2 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
MLDM
2005
Springer
14 years 2 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé
SENSYS
2004
ACM
14 years 2 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...