613 search results - page 61 / 123 » The Model-Summary Problem and a Solution for Trees |
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
LICS
2007
IEEE
15 years 4 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...
AAAI
1996
14 years 11 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
AI
2010
Springer
14 years 10 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
IJAIT
2002
14 years 9 months ago
2002
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...