416 search results - page 68 / 84 » Simple and Efficient Algorithm for Approximate Dictionary Ma... |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
70
Voted
CGF
2000
14 years 9 months ago
2000
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...