216 search results - page 30 / 44 » Learning Minimum Volume Sets |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
MM
2009
ACM
14 years 4 months ago
2009
ACM
This paper presents a novel motion localization approach for recognizing actions and events in real videos. Examples include StandUp and Kiss in Hollywood movies. The challenge ca...
ICML
2002
IEEE
14 years 10 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
ALT
2010
Springer
13 years 11 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...