5785 search results - page 481 / 1157 » Approximability of Probability Distributions |
168
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
167
click to vote
ANOR
2006
15 years 7 months ago
2006
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
159
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by...
175
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
223
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...