519 search results - page 13 / 104 » A New Approach to Strongly Polynomial Linear Programming |
100
click to vote
DISOPT
2008
15 years 1 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
147
click to vote
NMR
2004
Springer
15 years 6 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
152
click to vote
ARITH
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
MP
1998
15 years 1 months ago
1998
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
126
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...