8 search results - page 1 / 2 » The List Update Problem: Improved Bounds for the Counter Sch... |
ALGORITHMICA
1998
13 years 4 months ago
1998
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
STOC
2002
ACM
14 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...
CRYPTO
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
JMLR
2010
12 years 11 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
IEEEPACT
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper, we look at two issues which could affect the performance of value prediction on wide-issue ILP processors. One is the large number of accesses to the value predicti...