520 search results - page 93 / 104 » Reductions Between Expansion Problems |
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...