Sciweavers

207 search results - page 33 / 42
» Unsupervised Learning for Graph Matching
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Locally Constrained Diffusion Process on Locally Densified Distance Spaces with Applications to Shape Retrieval
The matching and retrieval of 2D shapes is an important challenge in computer vision. A large number of shape similarity approaches have been developed, with the main focus bein...
Xingwei Yang (Temple University), Suzan Koknar-Tez...
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 7 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
COLING
2010
13 years 2 months ago
EMMA: A novel Evaluation Metric for Morphological Analysis
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
Sebastian Spiegler, Christian Monson
CVPR
2008
IEEE
14 years 9 months ago
A deformable local image descriptor
This paper presents a novel local image descriptor that is robust to general image deformations. A limitation with traditional image descriptors is that they use a single support ...
Hong Cheng, Zicheng Liu, Nanning Zheng, Jie Yang
JMLR
2010
165views more  JMLR 2010»
13 years 2 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...