455 search results - page 45 / 91 » A local approximation algorithm for maximum weight matching |
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
CONIELECOMP
2005
IEEE
15 years 3 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
119
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...