Sciweavers

2127 search results - page 55 / 426
» Computing large matchings fast
Sort
View
127
Voted
ICIAP
2007
ACM
16 years 3 months ago
Efficient and optimal block matching for motion estimation
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
BMVC
2010
15 years 1 months ago
Generalized Descriptor Compression for Storage and Matching
Smarter phones have made handheld computer vision a reality, but limited bandwidth, storage space and processing power prevent mobile phones from leveraging the full body of exist...
Matthew Johnson
CSB
2004
IEEE
142views Bioinformatics» more  CSB 2004»
15 years 7 months ago
FastR: Fast Database Search Tool for Non-Coding RNA
The discovery of novel non-coding RNAs has been among the most exciting recent developments in Biology. Yet, many more remain undiscovered. It has been hypothesized that there is ...
Vineet Bafna, Shaojie Zhang
128
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
114
Voted
ICCV
2009
IEEE
15 years 1 months ago
Matching as a non-cooperative game
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
Andrea Albarelli, Samuel Rota Bulò, Andrea ...