434 search results - page 33 / 87 » Logical Analysis of Hash Functions |
118
Voted
FPGA
2004
ACM
15 years 5 months ago
2004
ACM
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
101
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
CAV
2010
Springer
15 years 21 days ago
2010
Springer
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...
101
click to vote
CORR
2007
Springer
15 years 14 days ago
2007
Springer
We present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the program code of an application...
110
click to vote
CONPAR
1992
15 years 4 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...