Sciweavers

2127 search results - page 11 / 426
» Computing large matchings fast
Sort
View
CVPR
2012
IEEE
13 years 5 months ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff
123
Voted
DCC
2009
IEEE
15 years 10 months ago
Tree Histogram Coding for Mobile Image Matching
For mobile image matching applications, a mobile device captures a query image, extracts descriptive features, and transmits these features wirelessly to a server. The server reco...
David M. Chen, Sam S. Tsai, Vijay Chandrasekhar, G...
133
Voted
ICIP
2003
IEEE
16 years 5 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...
SPIN
2009
Springer
15 years 10 months ago
Fast, All-Purpose State Storage
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
Peter C. Dillinger, Panagiotis Manolios
129
Voted
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 7 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld