29 search results - page 5 / 6 » Tree Automata with Memory, Visibility and Structural Constra... |
POPL
2004
ACM
14 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
IJCAI
2003
13 years 7 months ago
2003
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
ASPLOS
2011
ACM
12 years 9 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
INFOVIS
2005
IEEE
13 years 11 months ago
2005
IEEE
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
ACL
1998
13 years 7 months ago
1998
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...