3044 search results - page 467 / 609 » Linear logical approximations |
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
VLDB
1999
ACM
14 years 2 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
TKDE
2008
13 years 10 months ago
2008
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractica...