4137 search results - page 66 / 828 » On the number of matchings of a tree |
106
click to vote
ACSC
2001
IEEE
15 years 5 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
138
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
121
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
128
click to vote
AUTONOMICS
2008
ACM
15 years 3 months ago
2008
ACM
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
102
click to vote
IANDC
1998
15 years 1 months ago
1998
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...