613 search results - page 20 / 123 » Matching Power |
ECCC
2010
14 years 9 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
73
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Prominent feature point descriptors such as SIFT and
SURF allow reliable real-time matching but at a compu-
tational cost that limits the number of points that can be
handled on...
56
Voted
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
GBRPR
2007
Springer
15 years 3 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
64
Voted
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most realtime stereo applic...