Sciweavers

116 search results - page 22 / 24
» Min-Wise Independent Permutations
Sort
View
PAMI
1998
170views more  PAMI 1998»
13 years 7 months ago
Ordinal Measures for Image Correspondence
—We present ordinal measures of association for image correspondence in the context of stereo. Linear correspondence measures like correlation and the sum of squared difference b...
Dinkar N. Bhat, Shree K. Nayar
FOCS
2010
IEEE
13 years 5 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 11 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 7 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger