3428 search results - page 185 / 686 » Making the Case |
167
click to vote
STACS
1992
Springer
15 years 8 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
173
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
149
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes ...
126
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...