Sciweavers

565 search results - page 40 / 113
» Geometry of Upper Probabilities
Sort
View
121
Voted
NIPS
2003
15 years 5 months ago
Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
Ingo Steinwart
131
Voted
NIPS
1998
15 years 5 months ago
Inference in Multilayer Networks via Large Deviation Bounds
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
Michael J. Kearns, Lawrence K. Saul
IPL
2011
88views more  IPL 2011»
14 years 10 months ago
Smooth movement and Manhattan path based Random Waypoint mobility
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Do...
116
Voted
ICIP
2003
IEEE
16 years 5 months ago
Sparse-parametric writer identification using heterogeneous feature groups
This paper evaluates the performance of edge-based directional probability distributions as features in writer identification in comparison to a number of non-angular features. It...
Lambert Schomaker, Marius Bulacu, Merijn van Erp
120
Voted
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 4 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson