65 search results - page 3 / 13 » Two Polynomial Time Algorithms for the Metro-line Crossing M... |
CCCG
2007
13 years 10 months ago
2007
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
CPM
2000
Springer
14 years 23 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
IPCO
1998
13 years 9 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...