Sciweavers

652 search results - page 93 / 131
» Linear Explicit Substitutions
Sort
View
ICFP
2002
ACM
14 years 8 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
14 years 5 months ago
A succinct memory model for automated design debugging
— In today’s complex SoC designs, verification and debugging are becoming ever more crucial and increasingly timeconsuming tasks. The prevalence of embedded memories adds to t...
Brian Keng, Hratch Mangassarian, Andreas G. Veneri...
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 5 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
ICCAD
2002
IEEE
175views Hardware» more  ICCAD 2002»
14 years 5 months ago
Efficient model order reduction via multi-node moment matching
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...
Yehea I. Ismail
CIDM
2009
IEEE
14 years 3 months ago
Large-scale attribute selection using wrappers
Abstract— Scheme-specific attribute selection with the wrapper and variants of forward selection is a popular attribute selection technique for classification that yields good ...
Martin Gutlein, Eibe Frank, Mark Hall, Andreas Kar...