Sciweavers

70 search results - page 8 / 14
» Approximation Reformulations
Sort
View
RSKT
2009
Springer
14 years 3 months ago
Learning Optimal Parameters in Decision-Theoretic Rough Sets
A game-theoretic approach for learning optimal parameter values for probabilistic rough set regions is presented. The parameters can be used to define approximation regions in a p...
Joseph P. Herbert, Jingtao Yao
ICANN
2007
Springer
14 years 2 months ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka
ADHOCNOW
2005
Springer
14 years 2 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
CSCLP
2004
Springer
14 years 2 months ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf
MICCAI
1999
Springer
14 years 26 days ago
Understanding the "Demon's Algorithm": 3D Non-rigid Registration by Gradient Descent
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
Xavier Pennec, Pascal Cachier, Nicholas Ayache