Sciweavers

1059 search results - page 17 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
ICNP
2006
IEEE
14 years 2 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
14 years 9 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
CONCUR
2000
Springer
14 years 1 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ICPR
2008
IEEE
14 years 10 months ago
Sensor planning for PTZ cameras using the probability of camera overload
Most existing sensor planning algorithms find it difficult to tackle the discrepancy between a PTZ camera's limited instant field of view (FOV) and panoramic achievable FOV. ...
Andreas Koschan, Besma R. Abidi, Chung-Hao Chen, D...
ICDCS
2009
IEEE
14 years 6 months ago
Optimizing File Retrieval in Delay-Tolerant Content Distribution Community
In WiFi-based content distribution community infrastructure (CDCI), file servers are deployed in diverse locations around cities, caching popular files interesting to a communit...
Ying Huang, Yan Gao, Klara Nahrstedt, Wenbo He