Sciweavers

16430 search results - page 2770 / 3286
» On Computable Tree Functions
Sort
View
JAIR
2006
90views more  JAIR 2006»
15 years 7 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
PAMI
2008
161views more  PAMI 2008»
15 years 7 months ago
TRUST-TECH-Based Expectation Maximization for Learning Finite Mixture Models
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...
GPEM
2007
119views more  GPEM 2007»
15 years 7 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
NAR
2006
177views more  NAR 2006»
15 years 7 months ago
PUMA2 - grid-based high-throughput analysis of genomes and metabolic pathways
The PUMA2 system (available at http://compbio.mcs. 10 anl.gov/puma2) is an interactive, integrated bioinformatics environment for high-throughput genetic sequence analysis and met...
Natalia Maltsev, Elizabeth M. Glass, Dinanath Sula...
IJON
2007
184views more  IJON 2007»
15 years 7 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
« Prev « First page 2770 / 3286 Last » Next »