Sciweavers

540 search results - page 24 / 108
» Comparing distributions and shapes using the kernel distance
Sort
View
ICPP
2009
IEEE
15 years 4 months ago
Perfomance Models for Blocked Sparse Matrix-Vector Multiplication Kernels
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...
JAIR
2010
132views more  JAIR 2010»
14 years 8 months ago
Using Local Alignments for Relation Recognition
This paper discusses the problem of marrying structural similarity with semantic relatedness for Information Extraction from text. Aiming at accurate recognition of relations, we ...
Sophia Katrenko, Pieter W. Adriaans, Maarten van S...
IJCV
2000
223views more  IJCV 2000»
14 years 9 months ago
The Earth Mover's Distance as a Metric for Image Retrieval
We investigate the properties of a metric between two distributions, the Earth Mover's Distance (EMD), for content-based image retrieval. The EMD is based on the minimal cost ...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas
89
Voted
ICCV
2007
IEEE
15 years 11 months ago
Correspondence Establishment in Statistical Modeling of Shapes with Arbitrary Topology
Correspondence establishment is a key step in statistical shape model building. There are several automated methods for solving this problem in 3D, but they usually can only handl...
Ekaterina Syrkina, Gábor Székely, Mi...
PRL
2006
139views more  PRL 2006»
14 years 9 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...