2354 search results - page 161 / 471 » Randomness, Stochasticity and Approximations |
132
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
183
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
144
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
122
click to vote
APJOR
2010
15 years 2 months ago
2010
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
137
click to vote
TELETRAFFIC
2007
Springer
15 years 10 months ago
2007
Springer
We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...