4342 search results - page 862 / 869 » Improved Algorithms for Optimal Embeddings |
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. It has been recently acknowledged [4, 6, 9] that the use of double bases representations of scalars n, that is an expression of the form n = e,s,t(-1)e As Bt can speed up...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
CSB
2004
IEEE
13 years 11 months ago
2004
IEEE
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
—Dynamic programmable logic arrays (PLAs) which are built of the NOR–NOR structure, have been very popular in high performance design because of their high-speed and predictabl...
DALT
2008
Springer
13 years 9 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...