Sciweavers

114 search results - page 9 / 23
» Attributed Tree Homomorphism Using Association Graphs
Sort
View
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
14 years 9 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias
NIPS
2001
13 years 8 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
PAMI
2006
164views more  PAMI 2006»
13 years 7 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
BMVC
2010
13 years 5 months ago
Classifying Textile Designs using Region Graphs
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
Wei Jia, Stephen J. McKenna, Annette A. Ward, Keit...
GTTSE
2007
Springer
14 years 1 months ago
Automated Merging of Feature Models Using Graph Transformations
Abstract. Feature Models (FMs) are a key artifact for variability and commonality management in Software Product Lines (SPLs). In this context, the merging of FMs is being recogniz...
Sergio Segura, David Benavides, Antonio Ruiz Cort&...