1060 search results - page 99 / 212 » On the Discovery of Random Trees |
151
click to vote
CG
2005
Springer
15 years 6 months ago
2005
Springer
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...
140
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
171
click to vote
ICML
2004
IEEE
15 years 11 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
163
click to vote
COLING
2008
15 years 7 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
177
click to vote
ICANN
2010
Springer
15 years 6 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...