Sciweavers

1763 search results - page 223 / 353
» Dependent random choice
Sort
View
ASIACRYPT
2004
Springer
14 years 1 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay
COLT
2000
Springer
14 years 13 days ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the ļ¬rst rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
14 years 8 days ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
COLT
2004
Springer
13 years 12 months ago
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
ECRTS
2004
IEEE
13 years 11 months ago
Comparing Real-Time Communication Under Electromagnetic Interference
The contribution of this paper is threefold. First, an improvement to a previously published paper on the timing analysis of Controller Area Network (CAN) in the presence of trans...
Ian Broster, Alan Burns, Guillermo Rodrígue...