205 search results - page 20 / 41 » On Approximation Algorithms for Hierarchical MAX-SAT |
121
click to vote
NIPS
2004
15 years 1 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
DAC
2011
ACM
13 years 11 months ago
2011
ACM
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
VISUALIZATION
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
153
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
187
click to vote
POPL
2006
ACM
16 years 2 days ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...