4137 search results - page 68 / 828 » On the number of matchings of a tree |
80
Voted
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
104
click to vote
SEMWEB
2007
Springer
15 years 8 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
215
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
243
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
102
Voted
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...