Sciweavers

286 search results - page 26 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
SSPR
2000
Springer
15 years 1 months ago
Prototype Learning with Attributed Relational Graphs
An algorithm for learning structural patterns given in terms of Attributed Relational Graphs (ARG's) is presented. The algorithm, based on inductive learning methodologies, pr...
Pasquale Foggia, Roberto Genna, Mario Vento
PR
2007
134views more  PR 2007»
14 years 9 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
PAMI
2007
154views more  PAMI 2007»
14 years 9 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
GBRPR
2007
Springer
15 years 1 months ago
Image Classification Using Marginalized Kernels for Graphs
We propose in this article an image classification technique based on kernel methods and graphs. Our work explores the possibility of applying marginalized kernels to image process...
Emanuel Aldea, Jamal Atif, Isabelle Bloch
IJON
2010
121views more  IJON 2010»
14 years 6 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen