2570 search results - page 127 / 514 » Fast Algorithms For The Computation Of Ranklets |
CVPR
2007
IEEE
16 years 8 days ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
CRYPTO
1995
Springer
15 years 1 months ago
1995
Springer
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
GD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
90
Voted
ISM
2008
IEEE
15 years 4 months ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...