Sciweavers

2430 search results - page 383 / 486
» Computing Tutte Polynomials
Sort
View
ICML
2006
IEEE
16 years 4 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
138
Voted
EUROCRYPT
2009
Springer
16 years 3 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
KDD
2005
ACM
86views Data Mining» more  KDD 2005»
16 years 3 months ago
Probabilistic workflow mining
In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model o...
Ricardo Silva, Jiji Zhang, James G. Shanahan
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
16 years 3 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
POPL
2003
ACM
16 years 3 months ago
A generic approach to the static analysis of concurrent programs with procedures
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
Ahmed Bouajjani, Javier Esparza, Tayssir Touili