681 search results - page 19 / 137 » General Polynomial Time Decomposition Algorithms |
CORR
2010
Springer
15 years 20 days ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
183
click to vote
VLSISP
2011
14 years 7 months ago
2011
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
122
Voted
GLVLSI
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we propose a novel statistical capacitance extraction method for interconnects considering process variations. The new method, called statCap, is based on the spect...
90
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
124
Voted
ESA
1999
Springer
15 years 4 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...