610 search results - page 69 / 122 » Fast Modular Reduction |
90
Voted
CONEXT
2008
ACM
15 years 2 months ago
2008
ACM
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
92
Voted
ICCD
2001
IEEE
15 years 9 months ago
2001
IEEE
A new iterative multiplier based on a self-timed clocking scheme is presented. To reduce the area required for the multiplier, only two CSA rows are iteratively used to complete a...
101
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
106
click to vote
AHS
2006
IEEE
15 years 2 months ago
2006
IEEE
This paper presents a multi-objective algorithm for on-line adaptation of a multi-carrier code-division multiple access (MC-CDMA) receiver. A specially tailored Genetic Algorithm ...
131
Voted
CRYPTO
2011
Springer
14 years 14 days ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...