197 search results - page 4 / 40 » A Parallel Algorithm for Solving Large Convex Minimax Proble... |
136
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
105
Voted
NIPS
2001
15 years 3 months ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
118
click to vote
GCB
2006
Springer
15 years 6 months ago
2006
Springer
: Despite many years of research on how to properly align sequences in the presence of sequencing errors, alternative splicing and micro-exons, the correct alignment of mRNA sequen...
105
click to vote
AAAI
2006
15 years 4 months ago
2006
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
127
Voted
PAMI
2011
14 years 9 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...