2609 search results - page 455 / 522 » Optimizing for parallelism and data locality |
122
Voted
ICCV
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
138
Voted
SIAMIS
2010
14 years 7 months ago
2010
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
124
click to vote
JMLR
2006
15 years 15 days ago
2006
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
92
Voted
BMCBI
2005
15 years 13 days ago
2005
Background: Generalized hidden Markov models (GHMMs) appear to be approaching acceptance as a de facto standard for state-of-the-art ab initio gene finding, as evidenced by the re...
122
click to vote
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...