329 search results - page 53 / 66 » Probably Approximately Correct Learning |
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Skeletonization algorithms typically decompose an object’s
silhouette into a set of symmetric parts, offering a
powerful representation for shape categorization. However,
havi...
COMPGEOM
2011
ACM
13 years 5 days ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...