Sciweavers

2397 search results - page 9 / 480
» Applications of integer relation algorithms
Sort
View
DISOPT
2008
78views more  DISOPT 2008»
13 years 10 months ago
N-fold integer programming
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 ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
TPCD
1994
157views Hardware» more  TPCD 1994»
13 years 11 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...
IPCO
2010
160views Optimization» more  IPCO 2010»
13 years 11 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...
JVCIR
2011
96views more  JVCIR 2011»
13 years 4 months ago
Stabilization and optimization of PLUS factorization and its application in image coding
A recently developed PLUS factorization holds great promise in image coding due to its simplicity and integer reversibility. However, existing PLUS factorizations did not consider...
Lei Yang, Pengwei Hao, Dapeng Wu
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 9 months ago
Recurrence relations and fast algorithms
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
Mark Tygert