5115 search results - page 426 / 1023 » On Randomized Lanczos Algorithms |
217
Voted
SODA
2008
ACM
15 years 9 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
191
click to vote
NIPS
2004
15 years 9 months ago
2004
We propose a gossip-based distributed algorithm for Gaussian mixture learning, Newscast EM. The algorithm operates on network topologies where each node observes a local quantity ...
196
click to vote
CORR
2008
Springer
15 years 7 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...
262
click to vote
TKDE
2012
13 years 10 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...
190
click to vote
INFOCOM
2009
IEEE
16 years 2 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...