4255 search results - page 144 / 851 » On Learning Boolean Functions |
DC
2010
14 years 10 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
ECCC
2010
14 years 8 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
ITC
2003
IEEE
15 years 3 months ago
2003
IEEE
A fault fj is said to dominate another fault fi if all tests for fi detect fj . When two faults dominate each other, they are called equivalent. Dominance and equivalence relation...
112
click to vote
EMNLP
2009
14 years 7 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...