Sciweavers

782 search results - page 73 / 157
» Can a Parser be Generated from Examples
Sort
View
120
Voted
ICIP
2008
IEEE
15 years 10 months ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy
RTA
2004
Springer
15 years 9 months ago
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
Salvador Lucas
ICML
2000
IEEE
16 years 4 months ago
Eligibility Traces for Off-Policy Policy Evaluation
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
Doina Precup, Richard S. Sutton, Satinder P. Singh
SMILE
1998
Springer
15 years 8 months ago
Automatic 3D Model Construction for Turn-Table Sequences
As virtual worlds demand ever more realistic 3D models, attention is being focussed on systems that can acquire graphical models from real objects. This paper describes a system wh...
Andrew W. Fitzgibbon, Geoffrey Cross, Andrew Zisse...
IJAR
2010
113views more  IJAR 2010»
15 years 2 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...