Sciweavers

4137 search results - page 63 / 828
» On the number of matchings of a tree
Sort
View
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 5 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
PEPM
2007
ACM
15 years 8 months ago
Behavioral similarity matching using concrete source code templates in logic queries
Program query languages and pattern-detection techniques are an essential part of program analysis and manipulation systems. Queries and patterns permit the identification of the...
Coen De Roover, Theo D'Hondt, Johan Brichau, Carlo...
123
Voted
CVPR
2005
IEEE
16 years 3 months ago
Randomized Trees for Real-Time Keypoint Recognition
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
Vincent Lepetit, Pascal Lagger, Pascal Fua
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 1 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
207
Voted
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 2 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore