5606 search results - page 893 / 1122 » Randomization Techniques for Graphs. |
239
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
213
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
183
click to vote
FPGA
2010
ACM
16 years 3 months ago
2010
ACM
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
193
click to vote
ICSE
2001
IEEE-ACM
15 years 11 months ago
2001
IEEE-ACM
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
165
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...