Sciweavers

4137 search results - page 144 / 828
» On the number of matchings of a tree
Sort
View
ENDM
2007
149views more  ENDM 2007»
15 years 6 months ago
Oriented vertex and arc colorings of partial 2-trees
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
Pascal Ochem, Alexandre Pinlou
FLAIRS
2008
15 years 8 months ago
A Backward Adjusting Strategy and Optimization of the C4.5 Parameters to Improve C4.5's Performance
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
Jason R. Beck, Maria Garcia, Mingyu Zhong, Michael...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 7 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
PPSN
2010
Springer
15 years 4 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...