2570 search results - page 379 / 514 » Fast Algorithms For The Computation Of Ranklets |
114
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Two major limitations of real-time visual SLAM algorithms are the restricted range of views over which they can operate and their lack of robustness when faced with erratic camera...
138
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
113
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
142
Voted
CHES
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
148
click to vote
PAKDD
2009
ACM
16 years 15 days ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...