Sciweavers

4007 search results - page 290 / 802
» Computation with imprecise probabilities
Sort
View
ICCV
2005
IEEE
15 years 10 months ago
Closely Coupled Object Detection and Segmentation
We propose a closely coupled object detection and segmentation algorithm for enhancing both processes in a cooperative and iterative manner. Figure-ground segmentation reduces the...
Liang Zhao, Larry S. Davis
CVBIA
2005
Springer
15 years 10 months ago
Multi-modal Image Registration by Quantitative-Qualitative Measure of Mutual Information (Q-MI)
Abstract. This paper presents a novel measure of image similarity, called quantitative-qualitative measure of mutual information (Q-MI), for multi-modal image registration. Convent...
Hongxia Luan, Feihu Qi, Dinggang Shen
EUROCRYPT
2005
Springer
15 years 10 months ago
Cryptanalysis of the Hash Functions MD4 and RIPEMD
MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996, Dobbertin showed ...
Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, ...
PKC
2005
Springer
89views Cryptology» more  PKC 2005»
15 years 10 months ago
A New Related Message Attack on RSA
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
Oded Yacobi, Yacov Yacobi
STACS
2004
Springer
15 years 10 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...