Sciweavers

4007 search results - page 729 / 802
» Computation with imprecise probabilities
Sort
View
DCOSS
2006
Springer
14 years 17 days ago
Comparative Analysis of Push-Pull Query Strategies for Wireless Sensor Networks
Abstract. We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-c...
Shyam Kapadia, Bhaskar Krishnamachari
DIS
2006
Springer
14 years 17 days ago
Visual Interactive Subgroup Discovery with Numerical Properties of Interest
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...
Alípio Mário Jorge, Fernando Pereira...
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
14 years 14 days ago
Incremental quantile estimation for massive tracking
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
Fei Chen, Diane Lambert, José C. Pinheiro
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 13 days ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
IPPS
1997
IEEE
14 years 13 days ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei