110 search results - page 4 / 22 » A Faster Algorithm for Quasi-convex Integer Polynomial Optim... |
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
118
click to vote
CASES
2004
ACM
15 years 3 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
DISOPT
2008
14 years 10 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 ...
MP
2007
14 years 9 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
183
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...