4894 search results - page 617 / 979 » The Guarding Problem - Complexity and Approximation |
158
click to vote
AIRWEB
2005
Springer
16 years 11 days ago
2005
Springer
This paper investigates the influence of different page features on the ranking of search engine results. We use Google (via its API) as our testbed and analyze the result rankin...
162
click to vote
COCOON
2005
Springer
16 years 10 days ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
172
click to vote
CIKM
2004
Springer
16 years 6 days ago
2004
Springer
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
199
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
188
click to vote
COLT
2003
Springer
16 years 1 days ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...