368 search results - page 29 / 74 » Sphere Methods for LP |
107
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
128
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
ICCS
2005
Springer
15 years 7 months ago
2005
Springer
Surfaces subdivision is an important means for geometric computing of surfaces in CAD. This paper proposes a new quadric subdivision for canal surfaces in this paper, RQ-sphere dec...
102
click to vote
SPAA
1992
ACM
15 years 6 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
109
click to vote
DATE
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper proposes a yield optimization method for standard-cells under timing constraints. Yield-aware logic synthesis and physical optimization require yield-enhanced standard ...