380 search results - page 19 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
110
click to vote
ISBI
2002
IEEE
15 years 6 months ago
2002
IEEE
Determining the relationship between structure (i.e. morphology) and function is a fundamental problem in brain research. In this paper we present a new framework based on Bayesia...
114
click to vote
DCC
2011
IEEE
14 years 8 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
108
click to vote
ADCM
2007
15 years 1 months ago
2007
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
123
Voted
DAC
2004
ACM
16 years 2 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
107
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...