Sciweavers

65 search results - page 10 / 13
» Convergence of a Generalized Gradient Selection Approach for...
Sort
View
SIAMMAX
2011
157views more  SIAMMAX 2011»
12 years 10 months ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
ATAL
2009
Springer
14 years 2 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
BMCBI
2006
161views more  BMCBI 2006»
13 years 7 months ago
A novel approach to phylogenetic tree construction using stochastic optimization and clustering
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
Ling Qin, Yixin Chen, Yi Pan, Ling Chen
CSDA
2007
106views more  CSDA 2007»
13 years 7 months ago
Parsimonious additive models
A new method for function estimation and variable selection, specifically designed for additive models fitted by cubic splines is proposed.This new method involves regularizing ...
Marta Avalos, Yves Grandvalet, Christophe Ambroise
GIS
2009
ACM
13 years 11 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov