1547 search results - page 82 / 310 » Randomized Variable Elimination |
118
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
110
click to vote
COCO
1991
Springer
15 years 6 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
226
click to vote
ASPDAC
2008
ACM
15 years 5 months ago
2008
ACM
A major trend in a modern system-on-chip design is a growing system complexity, which results in a sharp increase of communication traffic on the on-chip communication bus architec...
129
click to vote
UAI
2004
15 years 4 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
165
click to vote
ICIP
1998
IEEE
16 years 4 months ago
1998
IEEE
This paper proposes a restoration scheme for noisy images generated by coherent imaging systems (e.g., synthetic aperture radar, synthetic aperture sonar, ultrasound imaging, and ...