Sciweavers

711 search results - page 55 / 143
» Matching Hierarchical Structures Using Association Graphs
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
SEW
2005
IEEE
14 years 1 months ago
A Generative Style-driven Framework for Software Architecture Design
Compared with texts, graphs are more intuitive to express comparative and structural information. Many graphical approaches, however, lack a formal basis for precise specification...
Jun Kong, Kang Zhang, Jing Dong, Guang-Lei Song
SDM
2007
SIAM
167views Data Mining» more  SDM 2007»
13 years 9 months ago
Bandits for Taxonomies: A Model-based Approach
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
Sandeep Pandey, Deepak Agarwal, Deepayan Chakrabar...
SSPR
1998
Springer
13 years 12 months ago
Object Recognition from Large Structural Libraries
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
Benoit Huet, Edwin R. Hancock
ICML
2009
IEEE
14 years 8 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy