Sciweavers

706 search results - page 63 / 142
» On a quasi-ordering on Boolean functions
Sort
View
BMCBI
2007
164views more  BMCBI 2007»
13 years 9 months ago
Comparison of probabilistic Boolean network and dynamic Bayesian network approaches for inferring gene regulatory networks
Background: The regulation of gene expression is achieved through gene regulatory networks (GRNs) in which collections of genes interact with one another and other substances in a...
Peng Li, Chaoyang Zhang, Edward J. Perkins, Ping G...
BMCBI
2002
131views more  BMCBI 2002»
13 years 8 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
CHI
2005
ACM
14 years 9 months ago
A logic block enabling logic configuration by non-experts in sensor networks
Recent years have seen the evolution of networks of tiny low power computing blocks, known as sensor networks. In one class of sensor networks, a non-expert user, who has little o...
Susan Cotterell, Frank Vahid
IJCAI
1993
13 years 10 months ago
Generalization of the Dempster-Shafer Theory
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
J. W. Guan, David A. Bell
EUROCRYPT
2001
Springer
14 years 1 months ago
Hyper-bent Functions
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine mon...
Amr M. Youssef, Guang Gong