Sciweavers

416 search results - page 28 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
COMPUTING
2004
107views more  COMPUTING 2004»
13 years 7 months ago
Efficient Collision Detection for Moving Ellipsoids Using Separating Planes
We present a simple, accurate and efficient algorithm for collision detection among moving ellipsoids. Its efficiency is attributed to two results: (i) a simple algebraic test for...
Wenping Wang, Yi-King Choi, Bin Chan, Myung-Soo Ki...
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
14 years 8 months ago
Efficient Macromodeling for On-Chip Interconnects
The improved T and improved n models are proposed for onchip interconnect macromodeling. Using global approximations, simple approximation frames are derived and applied to modeli...
Qinwei Xu, Pinaki Mazumder
ECCV
2006
Springer
14 years 9 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
DEXA
2008
Springer
155views Database» more  DEXA 2008»
13 years 9 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
ICIAP
1999
ACM
13 years 12 months ago
Bayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
Richard Myers, Richard C. Wilson, Edwin R. Hancock