Sciweavers

5115 search results - page 562 / 1023
» On Randomized Lanczos Algorithms
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 11 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
15 years 8 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
TIFS
2010
173views more  TIFS 2010»
15 years 5 months ago
A hybrid approach for generating secure and discriminating face template
Abstract—Biometric template protection is one of the most important issues in deploying a practical biometric system. To tackle this problem, many algorithms, that do not store t...
Yi C. Feng, Pong C. Yuen, Anil K. Jain
CVPR
1999
IEEE
16 years 8 months ago
Radiometric Self Calibration
A simple algorithm is described that computes the radiometric responsefunction of an imaging system,from images of an arbitrar), scene taken using different exposures. The exposur...
Tomoo Mitsunaga, Shree K. Nayar
CVPR
2004
IEEE
16 years 8 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher