681 search results - page 42 / 137 » General Polynomial Time Decomposition Algorithms |
101
Voted
KDD
2003
ACM
16 years 28 days ago
2003
ACM
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
99
Voted
DISOPT
2008
15 years 18 days ago
2008
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
94
Voted
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
113
click to vote
STOC
2004
ACM
16 years 25 days ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
91
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...