Sciweavers

324 search results - page 30 / 65
» Bounds for Functions of Dependent Risks
Sort
View
COLT
1999
Springer
15 years 4 months ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
15 years 1 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
ISOLA
2010
Springer
14 years 10 months ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...
AI
1998
Springer
14 years 11 months ago
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Tom Bylander
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 4 days ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio