93 search results - page 4 / 19 » Fast Monte-Carlo Algorithms for Finding Low-Rank Approximati... |
JMLR
2010
13 years 2 months ago
2010
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
CSDA
2010
13 years 7 months ago
2010
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...