Sciweavers

707 search results - page 13 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
LPAR
2001
Springer
14 years 9 days ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
INFOCOM
1999
IEEE
14 years 5 days ago
Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
Isabella Chang, Robert Engel, Dilip D. Kandlur, Di...
ML
1998
ACM
13 years 7 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
DATE
2009
IEEE
123views Hardware» more  DATE 2009»
14 years 2 months ago
On decomposing Boolean functions via extended cofactoring
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
Anna Bernasconi, Valentina Ciriani, Gabriella Truc...
ICCAD
2006
IEEE
140views Hardware» more  ICCAD 2006»
14 years 4 months ago
Efficient Boolean characteristic function for fast timed ATPG
Yu-Min Kuo, Yue-Lung Chang, Shih-Chieh Chang