Sciweavers

461 search results - page 26 / 93
» An Algorithm for Bi-Decomposition of Logic Functions
Sort
View
93
Voted
CSCLP
2007
Springer
15 years 3 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
BMCBI
2007
112views more  BMCBI 2007»
14 years 9 months ago
Inferring biological functions and associated transcriptional regulators using gene set expression coherence analysis
Background: Gene clustering has been widely used to group genes with similar expression pattern in microarray data analysis. Subsequent enrichment analysis using predefined gene s...
Tae-Min Kim, Yeun-Jun Chung, Mun-Gan Rhyu, Myeong ...
DAC
2002
ACM
15 years 10 months ago
Software synthesis from synchronous specifications using logic simulation techniques
This paper addresses the problem of automatic generation of implementation software from high-level functional specifications in the context of embedded system on chip designs. So...
Yunjian Jiang, Robert K. Brayton
172
Voted
ICLP
2009
Springer
15 years 10 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
DATE
2004
IEEE
123views Hardware» more  DATE 2004»
15 years 1 months ago
Synthesis and Optimization of Threshold Logic Networks with Application to Nanotechnologies
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currentl...
Rui Zhang, Pallav Gupta, Lin Zhong, Niraj K. Jha