2107 search results - page 244 / 422 » Computing Small Search Numbers in Linear Time |
COMGEO
2011
ACM
13 years 4 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
IEICET
2006
13 years 9 months ago
2006
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
IJCV
1998
13 years 9 months ago
1998
Object localization using sensed data features and corresponding model features is a fundamental problem in machine vision. We reformulate object localization as a least squares p...
AAAI
2008
13 years 11 months ago
2008
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...