4498 search results - page 379 / 900 » How to Invent Functions |
135
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
170
click to vote
APWEB
2008
Springer
15 years 8 months ago
2008
Springer
Techniques for being able to automatically identify acronym patterns are very important for enhancing a multitude of applications that rely upon search. This task is challenging, d...
168
click to vote
ASPLOS
2008
ACM
15 years 8 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
191
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
196
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...