1898 search results - page 230 / 380 » Weak Keys for IDEA |
121
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In this work, we propose algorithms to recursively and causally reconstruct a sequence of natural images from a reduced number of linear projection measurements taken in a domain ...
132
click to vote
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
122
Voted
DAC
1999
ACM
16 years 4 months ago
1999
ACM
We present a framework for rapidly exploring the design space of low power application-specific programmable processors (ASPP), in particular mediaprocessors. We focus on a catego...
127
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
In the model-based policy search approach to reinforcement learning (RL), policies are found using a model (or "simulator") of the Markov decision process. However, for ...
125
Voted
SIGSOFT
2005
ACM
16 years 4 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...