Sciweavers

2407 search results - page 277 / 482
» The evolutionary forest algorithm
Sort
View
OPODIS
2008
15 years 7 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ENTCS
2008
99views more  ENTCS 2008»
15 years 6 months ago
SPPF-Style Parsing From Earley Recognisers
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
Elizabeth Scott
PAMI
2007
166views more  PAMI 2007»
15 years 5 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
171
Voted
ICIP
2010
IEEE
15 years 4 months ago
Pyramidal segmentation using higher-order local auto-correlations and its applications to Landsat forestry data
The goal of image segmentation is to partition an image into regions that are internally homogeneous and heterogeneous with respect to neighbouring regions. Recently, a link shifti...
Milos Stojmenovic, Takumi Kobayashi, Nobuyuki Otsu
COCOON
2006
Springer
15 years 10 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia