Sciweavers

1117 search results - page 25 / 224
» Equivalent Representations of Set Functions
Sort
View
116
Voted
MST
2007
132views more  MST 2007»
15 years 3 months ago
Odometers on Regular Languages
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
Valérie Berthé, Michel Rigo
ICCD
2000
IEEE
79views Hardware» more  ICCD 2000»
16 years 16 days ago
Efficient Logic Optimization Using Regularity Extraction
This paper presents a new method to extract functionally equivalent structures from logic netlists. It uses a fast functional regularity extraction algorithm based on structural e...
Thomas Kutzschebauch
144
Voted
IACR
2011
106views more  IACR 2011»
14 years 3 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
112
Voted
SAS
2004
Springer
15 years 9 months ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
136
Voted
HPDC
2010
IEEE
15 years 4 months ago
Modeling sequence and function similarity between proteins for protein functional annotation
A common task in biological research is to predict function for proteins by comparing sequences between proteins of known and unknown function. This is often done using pair-wise ...
Roger Higdon, Brenton Louie, Eugene Kolker