558 search results - page 24 / 112 » Trees and Matchings |
ESOP
2004
Springer
15 years 5 months ago
2004
Springer
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...
229
click to vote
VLDB
2002
ACM
15 years 12 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
118
click to vote
ALGOSENSORS
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
103
Voted
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
101
click to vote
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...