Sciweavers

510 search results - page 50 / 102
» Complexity measures and decision tree complexity: a survey
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
15 years 6 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
INFSOF
2010
100views more  INFSOF 2010»
15 years 4 months ago
Investigating the impact of a measurement program on software quality
Context: Measurement programs have been around for several decades but have been often misused or misunderstood by managers and developers. This misunderstanding prevented their a...
Houari A. Sahraoui, Lionel C. Briand, Yann-Gaë...
EUROCRYPT
2004
Springer
15 years 11 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 10 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
TIP
2008
219views more  TIP 2008»
15 years 6 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...