187 search results - page 12 / 38 » On the uniform edge-partition of a tree |
ACL
2003
14 years 11 months ago
2003
This paper presents a method to develop a class of variable memory Markov models that have higher memory capacity than traditional (uniform memory) Markov models. The structure of...
STOC
1995
ACM
15 years 1 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
ICLP
1992
Springer
15 years 1 months ago
1992
Springer
: Whiledecision tree compilationis a promisingway tocarry out guard tests e ciently, the methods given in the literature do not take into account either the execution characteristi...
109
click to vote
CORR
2002
Springer
14 years 9 months ago
2002
Springer
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
90
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...