Sciweavers

123 search results - page 21 / 25
» Derandomizing from Random Strings
Sort
View
EATCS
1998
250views more  EATCS 1998»
13 years 7 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
ICASSP
2008
IEEE
14 years 1 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 22 days ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
ICBA
2004
Springer
143views Biometrics» more  ICBA 2004»
14 years 22 days ago
Externalized Fingerprint Matching
The 9/11 tragedy triggered an increased interest in biometric passports. According to several sources [2], the electronic ID market is expected to increase by more than 50% per ann...
Claude Barral, Jean-Sébastien Coron, David ...
ICDAR
2003
IEEE
14 years 19 days ago
Writer Identification using Innovative Binarised Features of Handwritten Numerals
The objective of this paper is to present a number of features that can be extracted from handwritten digits and used for author verification or identification of a person’s han...
Graham Leedham, Sumit Chachra