Sciweavers

1760 search results - page 28 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ISBI
2006
IEEE
14 years 8 months ago
Statistics of populations of images and its embedded objects: driving applications in neuroimaging
Work in progress towards modeling shape statistics of multiobject complexes is presented. Constraints defined by the set of objects such as a compact representation of object shap...
Guido Gerig, Sarang C. Joshi, P. Thomas Fletcher, ...
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
TOMACS
2010
79views more  TOMACS 2010»
13 years 2 months ago
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
Sumit Kunnumkal, Huseyin Topaloglu
SSPR
1998
Springer
13 years 12 months ago
Modified Minimum Classification Error Learning and Its Application to Neural Networks
A novel method to improve the generalization performance of the Minimum Classification Error (MCE) / Generalized Probabilistic Descent (GPD) learning is proposed. The MCE/GPD learn...
Hiroshi Shimodaira, Jun Rokui, Mitsuru Nakai
LMCS
2006
119views more  LMCS 2006»
13 years 7 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle