212 search results - page 20 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
CPM
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
IANDC
2008
13 years 7 months ago
2008
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...