1278 search results - page 120 / 256 » The Complexity of Weighted Boolean |
AI
2011
Springer
13 years 5 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
ICIP
2006
IEEE
14 years 12 months ago
2006
IEEE
In this paper, we apply supershapes and R-functions to surface recovery from 3D data sets. Individual supershapes are separately recovered from a segmented mesh. R-functions are u...
DAC
2003
ACM
14 years 11 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...