Sciweavers

93 search results - page 1 / 19
» A Practical Use of Imperfect Recall
Sort
View
SARA
2009
Springer
13 years 11 months ago
A Practical Use of Imperfect Recall
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
Kevin Waugh, Martin Zinkevich, Michael Johanson, M...
CORR
2004
Springer
88views Education» more  CORR 2004»
13 years 5 months ago
Sleeping Beauty Reconsidered: Conditioning and Reflection in Asynchronous Systems
A careful analysis of conditioning in the Sleeping Beauty problem is done, using the formal model for reasoning about knowledge and probability developed by Halpern and Tuttle. Wh...
Joseph Y. Halpern
ICDAR
1999
IEEE
13 years 9 months ago
On the Evaluation of Document Analysis Components by Recall, Precision, and Accuracy
In document analysis, it is common to prove the usefulness of a component by an experimental evaluation. By applying the respective algorithms to a test sample, some effectiveness...
Markus Junker, Andreas Dengel, Rainer Hoch
GRC
2007
IEEE
13 years 7 months ago
Precision and Recall in Rough Support Vector Machines
Abstract— Rough support vector machines (RSVMs) supplement conventional support vector machines (SVMs) by providing a better representation of the boundary region. Increasing int...
Pawan Lingras, Cory J. Butz
CIKM
2008
Springer
13 years 7 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee