111 search results - page 17 / 23 » The Complexity of Local List Decoding |
103
click to vote
ICDAR
2011
IEEE
13 years 10 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
75
Voted
HICSS
2002
IEEE
15 years 3 months ago
2002
IEEE
Contact management is an important part of everyday work. People exchange business cards to try to enter each other’s contact lists. Local businesses provide refrigerator magnet...
124
Voted
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
64
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
76
Voted
IPSN
2007
Springer
15 years 4 months ago
2007
Springer
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...