539 search results - page 34 / 108 » An Improved Upper Bound for SAT |
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
JAIR
2010
13 years 6 months ago
2010
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
BMCBI
2007
13 years 7 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
ENDM
2006
13 years 7 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...