Sciweavers

47 search results - page 2 / 10
» And Or Trees Revisited
Sort
View
CAI
2007
Springer
14 years 1 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
TPLP
2008
89views more  TPLP 2008»
13 years 7 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 7 months ago
Random Projection Trees Revisited
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
Aman Dhesi, Purushottam Kar
PE
2010
Springer
175views Optimization» more  PE 2010»
13 years 2 months ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami