983 search results - page 160 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
CHES
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
IUI
2009
ACM
14 years 5 months ago
2009
ACM
Numerous techniques exist to help users automate repetitive tasks; however, none of these methods fully support enduser creation, use, and modification of the learned tasks. We pr...
MOMPES
2009
IEEE
14 years 3 months ago
2009
IEEE
For embedded systems quality requirements are equally if not even more important than functional requirements. The foundation for the fulfillment of these quality requirements ha...
FMCAD
2009
Springer
14 years 3 months ago
2009
Springer
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...