662 search results - page 32 / 133 » Cheap and Fast - But is it Good |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
PERCOM
2004
ACM
14 years 7 months ago
2004
ACM
One way to improve inferences on sensor data is to tune the algorithms through a time-consuming offline procedure. A less expensive, and potentially more accurate method is to use...
ICS
2009
Tsinghua U.
14 years 2 months ago
2009
Tsinghua U.
General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest perfo...
CVPR
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we consider region-based variational segmentation of two- and three-dimensional images by the minimization of functionals whose fidelity term is the quotient of two...