1237 search results - page 31 / 248 » Abstract shade trees |
161
click to vote
ICGI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
118
Voted
EUROCRYPT
2010
Springer
15 years 9 months ago
2010
Springer
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
150
click to vote
FSTTCS
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
103
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
121
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...