Sciweavers

65 search results - page 6 / 13
» Belief function independence: II. The conditional case
Sort
View
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 8 months ago
Polymatroids with Network Coding
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
Te Sun Han
CDC
2010
IEEE
100views Control Systems» more  CDC 2010»
13 years 3 months ago
Impulsive systems triggered by superposed renewal processes
We consider impulsive systems with several reset maps triggered by independent renewal processes, i.e., the intervals between jumps associated with a given reset map are identicall...
Duarte Antunes, João Pedro Hespanha, Carlos...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 4 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
UAI
2008
13 years 10 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 9 months ago
Relationship privacy: output perturbation for queries with joins
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Su...