727 search results - page 31 / 146 » Private approximation of search problems |
WWW
2007
ACM
15 years 10 months ago
2007
ACM
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
83
Voted
TALG
2010
14 years 8 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
CPM
1999
Springer
15 years 1 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
66
Voted
ICDCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
77
Voted
INFORMS
2007
14 years 9 months ago
2007
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...