65 search results - page 1 / 13 » An Error Bound Based on a Worst Likely Assignment |
JMLR
2008
13 years 4 months ago
2008
This paper introduces a new PAC transductive error bound for classification. The method uses information from the training examples and inputs of working examples to develop a set...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
DAC
1995
ACM
13 years 8 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...
DATE
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Employing COTS components in real-time embedded systems leads to timing challenges. When multiple CPU cores and DMA peripherals run simultaneously, contention for access...
PKDD
2009
Springer
13 years 11 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...