Sciweavers

248 search results - page 13 / 50
» Rate of Convergence for Constrained Stochastic Approximation...
Sort
View
98
Voted
TSP
2008
151views more  TSP 2008»
14 years 11 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 4 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
111
Voted
ICML
2007
IEEE
16 years 14 days ago
Approximate maximum margin algorithms with rules controlled by the number of mistakes
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
Petroula Tsampouka, John Shawe-Taylor
126
Voted
TWC
2008
135views more  TWC 2008»
14 years 11 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
OL
2011
190views Neural Networks» more  OL 2011»
14 years 6 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal