692 search results - page 65 / 139 » BDD minimization for approximate computing |
154
click to vote
Publication
Drawbacks of the traditional scenario of image modeling by Gibbs random fields with multiple pairwise pixel interactions are outlined, and a more reasonable alternative scenario b...
96
Voted
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
TSMC
2008
14 years 11 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
214
click to vote
CSE
2012
IEEE
13 years 6 months ago
2012
IEEE
—Continuum quantum Monte Carlo (QMC) has proved to be an invaluable tool for predicting the properties of matter from fundamental principles. By solving the manybody Schr¨odinge...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...