20175 search results - page 107 / 4035 » Is abstraction the key to computing |
110
Voted
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
121
Voted
SIAMMAX
2011
14 years 7 months ago
2011
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
121
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
117
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
120
Voted
ECCV
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. With the rapid development of fast data acquisition techniques, 3D scans that record the geometric and photometric information of deformable objects are routinely acquire...