Sciweavers

3055 search results - page 170 / 611
» Randomized Search Trees
Sort
View
105
Voted
COMBINATORICA
2007
117views more  COMBINATORICA 2007»
15 years 20 days ago
Embedding nearly-spanning bounded degree trees
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
Noga Alon, Michael Krivelevich, Benny Sudakov
98
Voted
CG
2005
Springer
15 years 17 days ago
A polar-plane-based method for natural illumination of plants and trees
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...
Maria J. Vicent, Vicente Rosell, Roberto Viv&oacut...
85
Voted
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 6 months ago
Comparison of tree and graph encodings as function of problem complexity
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 ...
Michael D. Schmidt, Hod Lipson
ICML
2004
IEEE
15 years 6 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
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...
Hisashi Kashima, Yuta Tsuboi
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 5 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...