736 search results - page 40 / 148 » Algorithms for Ordinal Arithmetic |
173
click to vote
CORR
2011
Springer
15 years 28 days ago
2011
Springer
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
166
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
137
click to vote
GLVLSI
2007
IEEE
16 years 7 days ago
2007
IEEE
LNS (logarithmic number system) arithmetic has the advantages of high-precision and high performance in complex function computation. However, the large hardware problem in LNS ad...
188
click to vote
IACR
2011
14 years 5 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
149
click to vote
SAGT
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...