Sciweavers

421 search results - page 22 / 85
» String Distances and Uniformities
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
ICPR
2006
IEEE
14 years 8 months ago
CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images
It is a well documented fact that, for human readers, familiar text is more legible than unfamiliar text. Current-generation computer vision systems also are able to exploit some ...
Jon Louis Bentley, Sui-Yu Wang
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 28 days ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
CAIP
2009
Springer
246views Image Analysis» more  CAIP 2009»
14 years 1 days ago
A Novel Approach for Word Spotting Using Merge-Split Edit Distance
Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistenci...
Khurram Khurshid, Claudie Faure, Nicole Vincent
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
14 years 1 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala