24 search results - page 4 / 5 » Almost Optimal Explicit Selectors |
AFRICACRYPT
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
VLSID
2006
IEEE
14 years 7 months ago
2006
IEEE
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
JMLR
2006
13 years 6 months ago
2006
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
JCC
2006
13 years 6 months ago
2006
: We describe the implementation of a general and flexible Monte Carlo (MC) module for the program CHARMM, which is used widely for modeling biomolecular systems with empirical ene...