Sciweavers

96 search results - page 11 / 20
» Espresso-Signature: A New Exact Minimizer for Logic Function...
Sort
View
119
Voted
IPL
2007
105views more  IPL 2007»
15 years 9 days ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
ESOP
2012
Springer
13 years 8 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
108
Voted
ICCAD
1993
IEEE
85views Hardware» more  ICCAD 1993»
15 years 4 months ago
Input don't care sequences in FSM networks
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ï¬...
Huey-Yih Wang, Robert K. Brayton
IJCV
2002
129views more  IJCV 2002»
15 years 2 days ago
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe...
PLDI
2012
ACM
13 years 2 months ago
The implicit calculus: a new foundation for generic programming
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
Bruno C. d. S. Oliveira, Tom Schrijvers, Wontae Ch...