Sciweavers

328 search results - page 20 / 66
» On Approximating Multidimensional Probability Distributions ...
Sort
View
JUCS
2010
152views more  JUCS 2010»
13 years 3 months ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian
MOR
2007
149views more  MOR 2007»
13 years 8 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
IJCAI
2001
13 years 10 months ago
Approximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
Hanna Pasula, Stuart J. Russell
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICCV
2003
IEEE
14 years 10 months ago
Filtering Using a Tree-Based Estimator
Within this paper a new framework for Bayesian tracking is presented, which approximates the posterior distribution at multiple resolutions. We propose a tree-based representation...
Bjoern Stenger, Arasanathan Thayananthan, Philip H...