2084 search results - page 276 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
138
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
105
click to vote
COLT
2004
Springer
15 years 7 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
102
click to vote
JDA
2006
15 years 2 months ago
2006
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
136
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
100
click to vote
JPDC
2006
15 years 2 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...