116 search results - page 10 / 24 » On the tightness of the error bound in Ring-LWE |
159
click to vote
NIPS
2004
15 years 7 months ago
2004
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
145
click to vote
DAC
1995
ACM
15 years 9 months ago
1995
ACM
Abstract We observe that the switching activity at a circuit node, also called the transition density, can be extremely sensitive to the circuit internal delays. As a result, sligh...
163
click to vote
JMLR
2008
15 years 6 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
167
click to vote
TIT
2010
15 years 24 days ago
2010
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bou...
209
click to vote
TIT
2010
15 years 23 days ago
2010
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...