Sciweavers

1496 search results - page 81 / 300
» Definability of Initial Segments
Sort
View
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
15 years 8 months ago
Controlling Effective Introns for Multi-Agent Learning by Genetic Programming
This paper presents the emergence of the cooperative behavior for multiple agents by means of Genetic Programming (GP). For the purpose of evolving the effective cooperative behav...
Hitoshi Iba, Makoto Terao
DLOG
2006
15 years 5 months ago
PSPACE Automata for Description Logics
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
Jan Hladik, Rafael Peñaloza
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 4 months ago
Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
Laurent Najman
ECCV
2006
Springer
16 years 6 months ago
Subspace Estimation Using Projection Based M-Estimators over Grassmann Manifolds
Abstract. We propose a solution to the problem of robust subspace estimation using the projection based M-estimator. The new method handles more outliers than inliers, does not req...
Raghav Subbarao, Peter Meer
COLING
2000
15 years 5 months ago
Automatic Corpus-Based Thai Word Extraction with the C4.5 Learning Algorithm
"Word" is difficult to define in the languages that do not exhibit explicit word boundary, such as Thai. Traditional methods on defining words for this kind of languages...
Virach Sornlertlamvanich, Tanapong Potipiti, Thats...