5153 search results - page 434 / 1031 » Introduction to Randomized Algorithms |
148
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We consider a network of sensors deployed to sense a spatio-temporal field and infer parameters of interest about the field. We are interested in the case where each sensor's...
192
click to vote
TKDE
2012
13 years 7 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
142
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
146
click to vote
SIAMCOMP
2008
15 years 5 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
163
Voted
STOC
2002
ACM
16 years 5 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...