3049 search results - page 445 / 610 » On the Convergence of Bound Optimization Algorithms |
133
click to vote
STOC
1992
ACM
15 years 8 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
112
click to vote
SWAT
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
121
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...
156
click to vote
IANDC
2008
15 years 4 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
153
click to vote
IOPADS
1997
15 years 5 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...