Sciweavers

2767 search results - page 183 / 554
» Universal Exponentiation Algorithm
Sort
View
TC
2008
15 years 2 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
TIT
2008
86views more  TIT 2008»
15 years 2 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
IPPS
2010
IEEE
14 years 11 months ago
A simple thermal model for multi-core processors and its application to slack allocation
Abstract--Power density and heat density of multicore processor system are increasing exponentially with Moore's Law. High temperature on chip greatly affects its reliability,...
Zhe Wang, Sanjay Ranka
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
14 years 2 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
COLT
1993
Springer
15 years 6 months ago
Learning Binary Relations Using Weighted Majority Voting
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
Sally A. Goldman, Manfred K. Warmuth