Sciweavers

3341 search results - page 160 / 669
» On Bounded Queries and Approximation
Sort
View
92
Voted
ICCV
2005
IEEE
16 years 3 days ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
FOCS
2009
IEEE
15 years 5 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
DATE
2008
IEEE
93views Hardware» more  DATE 2008»
15 years 4 months ago
A Fast Approximation Algorithm for MIN-ONE SAT
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
Lei Fang, Michael S. Hsiao
89
Voted
NIPS
2003
14 years 11 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
MOC
1998
81views more  MOC 1998»
14 years 9 months ago
Discrete gauge invariant approximations of a time dependent Ginzburg-Landau model of superconductivity
Abstract. We present here a mathematical analysis of a nonstandard difference method for the numerical solution of the time dependent GinzburgLandau models of superconductivity. Th...
Qiang Du