Sciweavers

2127 search results - page 79 / 426
» Computing large matchings fast
Sort
View
ECCV
2006
Springer
16 years 5 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
125
Voted
EUROCAST
2003
Springer
108views Hardware» more  EUROCAST 2003»
15 years 8 months ago
Fast Entropy-Based Nonrigid Registration
Computer vision tasks such as learning, recognition, classification or segmentation applied to spatial data often requires spatial normalization of repeated features and structure...
Eduardo Suárez, Jose Aurelio Santana, Eduar...
153
Voted
ISMB
2003
15 years 5 months ago
PSI: indexing protein structures for fast similarity search
We consider the problem of finding similarities in protein structure databases. Our techniques extract feature vectors on triplets of SSEs (Secondary Structure Elements). Later, ...
Orhan Çamoglu, Tamer Kahveci, Ambuj K. Sing...
123
Voted
NAACL
2010
15 years 1 months ago
Cheap, Fast and Good Enough: Automatic Speech Recognition with Non-Expert Transcription
Deploying an automatic speech recognition system with reasonable performance requires expensive and time-consuming in-domain transcription. Previous work demonstrated that non-pro...
Scott Novotney, Chris Callison-Burch
274
Voted
ARITH
2011
IEEE
14 years 3 months ago
Fast Ripple-Carry Adders in Standard-Cell CMOS VLSI
— This paper presents a number of new high-radix ripple-carry adder designs based on Ling’s addition technique and a recently-published expansion thereof. The proposed adders a...
Neil Burgess