Sciweavers

4860 search results - page 488 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
IJCV
2000
93views more  IJCV 2000»
15 years 4 months ago
How Optimal Depth Cue Integration Depends on the Task
Bayesian parameter estimation can be used to generate statistically optimal solutions to the problem of cue integration. However, the complexity and dimensionality of these solutio...
Paul R. Schrater, Daniel Kersten
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 4 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
WABI
2010
Springer
170views Bioinformatics» more  WABI 2010»
15 years 2 months ago
Haplotypes versus Genotypes on Pedigrees
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...
Bonnie Kirkpatrick
ATAL
2005
Springer
15 years 9 months ago
Towards a theory of "local to global" in distributed multi-agent systems (II)
a growing need to study abstract problems in distributed multi-agent systems in a systematic way, as well as to provide a qualitative mathematical framework in which to compare po...
Daniel Yamins
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 8 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...