Sciweavers

1390 search results - page 126 / 278
» On the Algebraic Structure of Convergence
Sort
View
JMLR
2010
115views more  JMLR 2010»
15 years 4 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
MOC
2011
15 years 1 months ago
Analysis of HDG methods for Stokes flow
Abstract. In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k for all the c...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Ngoc C...
ICML
2005
IEEE
16 years 7 months ago
Online learning over graphs
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
Mark Herbster, Massimiliano Pontil, Lisa Wainer
AB
2007
Springer
16 years 20 days ago
Cascaded Games
We introduce a novel model construction, cascaded games, that is intended to allow us to study the notion of steady states algebraically and structurally. The model construction is...
Jittisak Senachak, Mun'delanji Vestergaard, Ren&ea...
CSL
2004
Springer
15 years 12 months ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat