Sciweavers

3708 search results - page 442 / 742
» Approximating Betweenness Centrality
Sort
View
PR
2000
130views more  PR 2000»
15 years 6 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
ML
2002
ACM
168views Machine Learning» more  ML 2002»
15 years 6 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
NPL
1998
87views more  NPL 1998»
15 years 6 months ago
Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...
Stavros J. Perantonis, Nikolaos Ampazis, Stavros V...
TIT
1998
126views more  TIT 1998»
15 years 6 months ago
An Asymptotic Property of Model Selection Criteria
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
Yuhong Yang, Andrew R. Barron
QUESTA
2008
82views more  QUESTA 2008»
15 years 6 months ago
Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
To obtain insight in the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s . I...
Augustus J. E. M. Janssen, Johan van Leeuwaarden, ...