Sciweavers

712 search results - page 35 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
114
Voted
ENTCS
2006
113views more  ENTCS 2006»
14 years 10 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
PAMI
2000
113views more  PAMI 2000»
14 years 10 months ago
Hierarchical Discriminant Regression
This paper presents a new technique which incrementally builds a hierarchical discriminant regression (IHDR) tree for generation of motion based robot reactions. The robot learned...
Wey-Shiuan Hwang, Juyang Weng
ICGA
2008
208views Optimization» more  ICGA 2008»
14 years 10 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
MICCAI
2007
Springer
15 years 11 months ago
Automatic Fetal Measurements in Ultrasound Using Constrained Probabilistic Boosting Tree
Abstract. Automatic delineation and robust measurement of fetal anatomical structures in 2D ultrasound images is a challenging task due to the complexity of the object appearance, ...
Gustavo Carneiro, Bogdan Georgescu, Sara Good, Dor...
100
Voted
ACL
2009
14 years 8 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad