In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
In this paper, we derive and evaluate theoretical ratedistortion performance bounds for scalable video compression algorithms which use a single motion-compensated prediction (MCP...
Gregory W. Cook, Josep Prades-Nebot, Edward J. Del...
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...