4940 search results - page 691 / 988 » On the Complexity of Universal Programs |
198
click to vote
ACNS
2011
Springer
14 years 10 months ago
2011
Springer
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
261
click to vote
CGO
2011
IEEE
14 years 10 months ago
2011
IEEE
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
198
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
191
click to vote
JOTA
2011
14 years 9 months ago
2011
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
195
click to vote
JMLR
2012
13 years 9 months ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...