Sciweavers

16430 search results - page 311 / 3286
» On Computable Tree Functions
Sort
View
SRDS
1998
IEEE
15 years 9 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz
DIS
2004
Springer
15 years 8 months ago
Generating AVTs Using GA for Learning Decision Tree Classifiers with Missing Data
Abstract. Attribute value taxonomies (AVTs) have been used to perform AVT-guided decision tree learning on partially or totally missing data. In many cases, user-supplied AVTs are ...
Jinu Joo, Jun Zhang 0002, Jihoon Yang, Vasant Hona...
123
Voted
ICPR
2010
IEEE
15 years 5 months ago
Connected Component Trees for Multivariate Image Processing and Applications in Astronomy
In this paper, we investigate the possibilities offered by the extension of the connected component trees (cc-trees) to multivariate images. We propose a general framework for ima...
Benjamin Perret, Sébastien Lefèvre, ...
TCS
2010
15 years 3 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
CG
2010
Springer
15 years 2 months ago
Score Bounded Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
Tristan Cazenave, Abdallah Saffidine