12519 search results - page 141 / 2504 » Approximation Problems Categories |
147
click to vote
IPL
2008
15 years 6 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
286
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
204
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
161
click to vote
CCCG
2008
15 years 7 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
159
click to vote
IPL
2007
15 years 6 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...