Sciweavers

507 search results - page 30 / 102
» Sizes of Ordered Decision Trees
Sort
View
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
SIGMETRICS
2008
ACM
179views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Xengine: a fast and scalable XACML policy evaluation engine
XACML has become the de facto standard for specifying access control policies for various applications, especially web services. With the explosive growth of web applications depl...
Alex X. Liu, Fei Chen, JeeHyun Hwang, Tao Xie
ACTA
2010
191views more  ACTA 2010»
13 years 8 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
IEICET
2008
67views more  IEICET 2008»
13 years 8 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
ISMVL
2003
IEEE
125views Hardware» more  ISMVL 2003»
14 years 1 months ago
Compact Representations of Logic Functions using Heterogeneous MDDs
In this paper, we propose a compact representation of logic functions using Multi-valued Decision Diagrams (MDDs) called heterogeneous MDDs. In a heterogeneous MDD, each variable ...
Shinobu Nagayama, Tsutomu Sasao