3108 search results - page 71 / 622 » The Elements of Computer Credibility |
ITNG
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper, the first in a series of four, presents the conceptual design of a subsystem with integrative function based on a Service-Oriented Architecture (SOA), named Geographic...
141
click to vote
CVPR
2012
IEEE
13 years 7 days ago
2012
IEEE
Although the scale of isotropic visual elements such as blobs and interest points, e.g. SIFT[12], has been well studied and adopted in various applications, how to determine the s...
BSL
2005
14 years 9 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
CRYPTO
2007
Springer
15 years 4 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...