186 search results - page 3 / 38 » Speeding up algorithms on compressed web graphs |
WWW
2008
ACM
14 years 6 months ago
2008
ACM
This paper introduces a novel method for composing Web services in the presence of external volatile information. Our approach, which we call the informed-presumptive, is compared...
MP
2010
13 years 2 days ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
SODA
2010
ACM
13 years 4 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
STACS
1992
Springer
13 years 9 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...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Web processes must often operate in volatile environments where the quality of service parameters of the participating service providers change during the life time of the process...