Sciweavers

824 search results - page 82 / 165
» Weighted Low-Rank Approximations
Sort
View
NN
2000
Springer
192views Neural Networks» more  NN 2000»
14 years 9 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
AI
2011
Springer
14 years 4 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
CVPR
2012
IEEE
13 years 8 days ago
Spatial bias in multi-atlas based segmentation
Multi-atlas segmentation has been widely applied in medical image analysis. With deformable registration, this technique realizes label transfer from pre-labeled atlases to unknow...
Hongzhi Wang, Paul A. Yushkevich
ICML
2005
IEEE
15 years 10 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
15 years 3 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev