478 search results - page 82 / 96 » Approximation algorithms for general packing problems and th... |
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Design optimization is a well established application field of evolutionary computation. However, standard recombination operators acting on the genotypic representation of the d...
AAAI
2007
13 years 11 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...