3600 search results - page 103 / 720 » The settling-time reducibility ordering |
153
click to vote
DSD
2010
IEEE
15 years 6 months ago
2010
IEEE
Low power techniques in a FPGA implementation of the hash function called Luffa are presented in this paper. This hash function is under consideration for adoption as standard. Tw...
181
Voted
ANOR
2006
15 years 6 months ago
2006
This paper presents two contributions: A set of routines that manipulate instances of stochastic programming problems in order to make them more amenable for different solution ap...
139
Voted
JCT
2006
15 years 6 months ago
2006
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded ...
167
click to vote
MST
2008
15 years 6 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
157
click to vote
JISE
1998
15 years 5 months ago
1998
straction reduces the number of states necessary to perform formal verification while maintaining the functionality of the original model with respect to ifications to be verified....