Sciweavers

34 search results - page 3 / 7
» Situations as Strings
Sort
View
CORR
2007
Springer
147views Education» more  CORR 2007»
14 years 9 months ago
Coding Solutions for the Secure Biometric Storage Problem
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...
Davide Schipani, Joachim Rosenthal
ICDAR
2003
IEEE
15 years 2 months ago
Using Character Recognition and Segmentation to Tell Computer from Humans
How do you tell a computer from a human? The situation arises often on the Internet, when online polls are conducted, accounts are requested, undesired email is received, and chat...
Patrice Y. Simard, Richard Szeliski, Josh Benaloh,...
MFCS
2005
Springer
15 years 3 months ago
Dimension Is Compression
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
María López-Valdés, Elvira Ma...
FUIN
2010
89views more  FUIN 2010»
14 years 8 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
CORR
2008
Springer
128views Education» more  CORR 2008»
14 years 9 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov