Sciweavers

707 search results - page 119 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
13 years 9 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
ECCC
2006
96views more  ECCC 2006»
13 years 8 months ago
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
Jan Arpe, Rüdiger Reischuk
MJ
2008
58views more  MJ 2008»
13 years 7 months ago
Using multi-threshold threshold gates in RTD-based logic design: A case study
Abstract - The basic building blocks for Resonant Tunnelling Diode (RTD) logic circuits are Threshold Gates (TGs) instead of the conventional Boolean gates (AND, OR, NAND, NOR) due...
Héctor Pettenghi, Maria J. Avedillo, Jos&ea...
ICFP
2007
ACM
14 years 7 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
WABI
2004
Springer
14 years 1 months ago
Finding Optimal Pairs of Patterns
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, ...