Sciweavers

2695 search results - page 61 / 539
» Learning Graph Matching
Sort
View
CVIU
2006
105views more  CVIU 2006»
15 years 2 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
109
Voted
BIOCOMP
2007
15 years 3 months ago
Learning Node Replacement Graph Grammars in Metabolic Pathways
— This paper describes graph-based relational, unsupervised learning algorithm to infer node replacement graph grammar and its application to metabolic pathways. We search for fr...
Jacek P. Kukluk, Chang Hun You, Lawrence B. Holder...
111
Voted
COLT
1993
Springer
15 years 6 months ago
Piecemeal Learning of an Unknown Environment
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
Margrit Betke, Ronald L. Rivest, Mona Singh
ICTAI
2007
IEEE
15 years 8 months ago
Constructing VEGGIE: Machine Learning for Context-Sensitive Graph Grammars
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
Keven Ates, Kang Zhang
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 24 days ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...