6142 search results - page 312 / 1229 » The Complexity of Partition Functions |
151
click to vote
JMLR
2002
15 years 6 months ago
2002
One of the most important fundamental properties of Bayesian networks is the representational power, reflecting what kind of functions they can or cannot represent. In this paper,...
183
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: The functional sites of a protein present important information for determining its cellular function and are fundamental in drug design. Accordingly, accurate methods...
159
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
168
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
123
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
As the density and complexity of FPGA-based designs has increased to 10,000 gates and beyond, the use of high-level design languages (HDLs) is rapidly supplanting schematic entry ...