740 search results - page 58 / 148 » An approximation ratio for biclustering |
TSP
2008
14 years 11 months ago
2008
Recent advances have been reported in detecting and estimating the location of more than one target within a single monopulse radar beam. Successful tracking of those targets has ...
119
click to vote
JUCS
2007
14 years 11 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
106
click to vote
TSP
2008
14 years 11 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
111
click to vote
IVC
2002
14 years 11 months ago
2002
In this paper, we describe a new approach for estimating and tracking three-dimensional (3D) pose of a human face from the face images obtained from a single monocular view with f...
STOC
2006
ACM
16 years 6 days ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...