347 search results - page 28 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
DAC
1996
ACM
15 years 4 months ago
1996
ACM
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
STOC
1989
ACM
15 years 3 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
118
click to vote
JMLR
2012
13 years 2 months ago
2012
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
IMCSIT
2010
14 years 9 months ago
2010
The paper presents an extended version of the SuperMatrix system -- a general tool supporting automatic acquisition of lexical semantic relations from corpora. Extensions focus mai...
106
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...