719 search results - page 36 / 144 » Solving Sparse Linear Constraints |
TIT
2011
14 years 7 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
108
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
95
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
104
Voted
ICRA
2009
IEEE
14 years 10 months ago
2009
IEEE
We present a novel method for prioritizing both linear equality and inequality systems and provide one algorithm for its resolution. This algorithm can be summarized as a sequence ...
123
Voted
CONSTRAINTS
2010
15 years 18 days ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...