Sciweavers

2743 search results - page 287 / 549
» Minimization of an M-convex Function
Sort
View
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Constraint extraction for pseudo-functional scan-based delay testing
Recent research results have shown that the traditional structural testing for delay and crosstalk faults may result in over-testing due to the non-trivial number of such faults t...
Yung-Chieh Lin, Feng Lu, Kai Yang, Kwang-Ting Chen...
CHES
2010
Springer
189views Cryptology» more  CHES 2010»
15 years 7 months ago
Quark: A Lightweight Hash
The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFI...
Jean-Philippe Aumasson, Luca Henzen, Willi Meier, ...
CPC
2004
98views more  CPC 2004»
15 years 6 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...
COLT
2004
Springer
15 years 10 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...
CL
2000
Springer
15 years 10 months ago
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
Tommi A. Junttila, Ilkka Niemelä