707 search results - page 13 / 142 » The Nonhomomorphicity of Boolean Functions |
163
Voted
LPAR
2001
Springer
15 years 9 months ago
2001
Springer
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...
146
Voted
INFOCOM
1999
IEEE
15 years 9 months ago
1999
IEEE
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...
126
Voted
ML
1998
ACM
15 years 4 months ago
1998
ACM
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...
107
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
102
Voted
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE