1091 search results - page 35 / 219 » Approximation Algorithms for Data Placement Problems |
SSDBM
2003
IEEE
14 years 1 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
PR
1998
13 years 7 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
PAMI
2008
13 years 7 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
JCP
2007
13 years 7 months ago
2007
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...