Sciweavers

258 search results - page 24 / 52
» Weak Bisimulation Approximants
Sort
View
SIAMCO
2002
71views more  SIAMCO 2002»
14 years 11 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
FSS
2010
111views more  FSS 2010»
14 years 10 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
PRL
2007
138views more  PRL 2007»
14 years 11 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
INFOCOM
2012
IEEE
13 years 2 months ago
Cherish every joule: Maximizing throughput with an eye on network-wide energy consumption
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou
ALT
2000
Springer
15 years 8 months ago
On Approximate Learning by Multi-layered Feedforward Circuits
Abstract. We consider the problem of efficient approximate learning by multilayered feedforward circuits subject to two objective functions. First, we consider the objective to ma...
Bhaskar DasGupta, Barbara Hammer