2492 search results - page 267 / 499 » On the General Signature Trees |
140
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
135
click to vote
KDD
1995
ACM
15 years 9 months ago
1995
ACM
An attribute-oriented rough set method for knowledgediscovery in databases is described. Themethodis based on information generalization, whichexaminesthe data at various levels o...
173
Voted
CATS
2006
15 years 7 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
145
click to vote
AAAI
1996
15 years 7 months ago
1996
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
147
click to vote
EJC
2010
15 years 6 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...