2477 search results - page 93 / 496 » Approximate extended formulations |
119
click to vote
LPNMR
2005
Springer
15 years 9 months ago
2005
Springer
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
137
click to vote
FOCS
1996
IEEE
15 years 8 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
184
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
122
click to vote
3DIM
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we address the problem of hand-eye calibration of a robot mounted video camera. In a rst time, we derive a new linear formulation of the problem. This allows an alg...
141
click to vote
DEDUCTIVE
1994
15 years 5 months ago
1994
Non-deterministic operators are needed in First-Order relational languages and Datalog to extend the expressive power of such languages and support efficient formulations of lowco...