Sciweavers

662 search results - page 32 / 133
» Cheap and Fast - But is it Good
Sort
View
CVPR
2004
IEEE
16 years 7 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
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...
Kristen Grauman, Trevor Darrell
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 5 months ago
Fast computation of low rank matrix
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...
Dimitris Achlioptas, Frank McSherry
PERCOM
2004
ACM
16 years 4 months ago
Employing User Feedback for Fast, Accurate, Low-Maintenance Geolocationing
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...
Ezekiel S. Bhasker, Steven W. Brown, William G. Gr...
ICS
2009
Tsinghua U.
16 years 2 days ago
Fast and scalable list ranking on the GPU
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...
M. Suhail Rehman, Kishore Kothapalli, P. J. Naraya...
CVPR
2006
IEEE
15 years 11 months ago
Fast Variational Segmentation using Partial Extremal Initialization
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...
Jan Erik Solem, Niels Chr. Overgaard, Markus Perss...