Sciweavers

455 search results - page 20 / 91
» On Trees and Noncrossing Partitions
Sort
View
UAI
1997
13 years 9 months ago
Nonuniform Dynamic Discretization in Hybrid Networks
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
Alexander V. Kozlov, Daphne Koller
GPEM
2000
103views more  GPEM 2000»
13 years 7 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
AAAI
1994
13 years 9 months ago
Emergent Linguistic Rules from inducing Decision Trees: Disambiguating Discourse Clue Words
We apply decision tree induction to the problem of discourse clue word sense disambiguation. The automatic partitioning of the training set which is intrinsic to decision tree ind...
Eric V. Siegel, Kathleen McKeown
IPPS
2007
IEEE
14 years 2 months ago
A Key-based Adaptive Transactional Memory Executor
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
Tongxin Bai, Xipeng Shen, Chengliang Zhang, Willia...
EJC
2010
13 years 7 months ago
Partitions versus sets: A case of duality
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...
Laurent Lyaudet, Frédéric Mazoit, St...