Sciweavers

5785 search results - page 23 / 1157
» Approximability of Probability Distributions
Sort
View
CN
2007
79views more  CN 2007»
15 years 1 months ago
A new method for approximating blocking probability in overflow loss networks
Eric W. M. Wong, Andrew Zalesky, Zvi Rosberg, Mosh...
ICCV
2003
IEEE
16 years 3 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...
FCT
2007
Springer
15 years 5 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
WSCG
2004
217views more  WSCG 2004»
15 years 2 months ago
Blending Textured Images Using a Non-parametric Multiscale MRF Method
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
Bernard Tiddeman
CCA
2009
Springer
15 years 8 months ago
Computability of Probability Distributions and Distribution Functions
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi