1236 search results - page 45 / 248 » fast 2010 |
ECCV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
ESA
2010
Springer
13 years 11 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
The goal of semi-supervised image segmentation is to obtain the segmentation from a partially labeled image. By utilizing the image manifold structure in labeled and unlabeled pix...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
We investigate the use of hierarchical Gaussian shortlists to speed up Gaussian likelihood computation. This approach is a combination of hierarchical Gaussian selection and stand...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...