Sciweavers

1469 search results - page 47 / 294
» Approximate polynomial decomposition
Sort
View
JMLR
2006
91views more  JMLR 2006»
14 years 9 months ago
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
We describe polynomial
Don R. Hush, Patrick Kelly, Clint Scovel, Ingo Ste...
WG
2005
Springer
15 years 3 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
GLVLSI
2008
IEEE
129views VLSI» more  GLVLSI 2008»
15 years 4 months ago
Variational capacitance modeling using orthogonal polynomial method
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...
Jian Cui, Gengsheng Chen, Ruijing Shen, Sheldon X....
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximation schemes for multidimensional packing
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
José R. Correa, Claire Kenyon
ICALP
2001
Springer
15 years 2 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger