96 search results - page 10 / 20 » Restructuring ordered binary trees |
123
click to vote
CC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
This paper presents an automatic video genre categorization scheme based on the hierarchical ontology on video genres. Ten computable spatio-temporal features are extracted to dis...
CG
2000
Springer
15 years 5 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
112
click to vote
ANLP
1992
15 years 2 months ago
1992
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...
IJCAI
2007
15 years 2 months ago
2007
Voting rules map collections of preference orderings over a set of candidates (one for each voter) to candidates. Now, in many contexts, we have to consider the case where either t...