Sciweavers

301 search results - page 30 / 61
» One-to-one mapping matrix
Sort
View
ICCV
2005
IEEE
16 years 3 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
GFKL
2007
Springer
123views Data Mining» more  GFKL 2007»
15 years 7 months ago
Projecting Dialect Distances to Geography: Bootstrap Clustering vs. Noisy Clustering
Abstract. Dialectometry produces aggregate distance matrices in which a distance is specified for each pair of sites. By projecting groups obtained by clustering onto geography on...
John Nerbonne, Peter Kleiweg, Wilbert Heeringa, Fr...
ASPDAC
2006
ACM
158views Hardware» more  ASPDAC 2006»
15 years 7 months ago
Analysis of scratch-pad and data-cache performance using statistical methods
— An effectively designed and efficiently used memory hierarchy, composed of scratch-pads or cache, is seen today as the key to obtaining energy and performance gains in data-do...
Javed Absar, Francky Catthoor
SEMWEB
2007
Springer
15 years 7 months ago
OLA in the OAEI 2007 Evaluation Contest
Abstract. Similarity has become a classical tool for ontology confrontation motivated by alignment, mapping or merging purposes. In the definition of an ontologybased measure one ...
Jean François Djoufak Kengue, Jér&oc...
SDM
2011
SIAM
370views Data Mining» more  SDM 2011»
14 years 4 months ago
Sparse Latent Semantic Analysis
Latent semantic analysis (LSA), as one of the most popular unsupervised dimension reduction tools, has a wide range of applications in text mining and information retrieval. The k...
Xi Chen, Yanjun Qi, Bing Bai, Qihang Lin, Jaime G....