1566 search results - page 87 / 314 » On a Cone Covering Problem |
152
click to vote
WADS
2007
Springer
16 years 11 days ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
162
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
In traditional multi-instance (MI) learning, a single positive instance in a bag produces a positive class label. Hence, the learner knows how the bag’s class label depends on th...
176
click to vote
JSYML
2010
15 years 1 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
149
click to vote
GLOBECOM
2007
IEEE
16 years 18 days ago
2007
IEEE
Abstract—In Chebyshev finite-impulse response (FIR) equalization, we design an FIR filter that minimizes the Chebyshev equalization error, i.e., the maximum absolute deviation ...
167
click to vote
PG
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an algorithm for computing the distance between two free-form surfaces. Using line geometry, the distance computation is reformulated as a simple instance of a surface-...