Sciweavers

19866 search results - page 3911 / 3974
» Computing all factorizations in ***
Sort
View
JMLR
2008
151views more  JMLR 2008»
14 years 12 months ago
Learning to Combine Motor Primitives Via Greedy Additive Regression
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
Manu Chhabra, Robert A. Jacobs
CSDA
2007
105views more  CSDA 2007»
14 years 12 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
JNCA
2008
86views more  JNCA 2008»
14 years 12 months ago
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Load balancing techniques play a critically important role in developing high-performance cluster computing platforms. Existing load balancing approaches are concerned with the ef...
Xiao Qin
JCB
2006
107views more  JCB 2006»
14 years 12 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
JGS
2006
154views more  JGS 2006»
14 years 12 months ago
Area-to-point Kriging with inequality-type data
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...
E.-H. Yoo, Phaedon C. Kyriakidis
« Prev « First page 3911 / 3974 Last » Next »