3250 search results - page 107 / 650 » An Algorithm to Solve a Linear Program |
152
Voted
SAC
2002
ACM
15 years 4 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
192
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
144
click to vote
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
A well-known theoretical result for motion estimation using the generalized camera model is that 17 corresponding image rays can be used to solve linearly for the motion of a gene...
102
click to vote
COR
2006
15 years 5 months ago
2006
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
131
Voted
TIT
2011
14 years 12 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...