453 search results - page 79 / 91 » Tight bounds for the partial-sums problem |
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...