Sciweavers

2354 search results - page 161 / 471
» Randomness, Stochasticity and Approximations
Sort
View
COMPGEOM
2008
ACM
13 years 11 months ago
Tighter bounds for random projections of manifolds
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...
Kenneth L. Clarkson
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 3 months ago
Fast Random Walk with Restart and Its Applications
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...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
CORR
2006
Springer
76views Education» more  CORR 2006»
13 years 9 months ago
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting
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...
Martin J. Wainwright
APJOR
2010
118views more  APJOR 2010»
13 years 7 months ago
Alternative Randomization for Valuing American Options
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...
Toshikazu Kimura
TELETRAFFIC
2007
Springer
14 years 3 months ago
Performance Analysis of a Fluid Queue with Random Service Rate in Discrete Time
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...
Onno J. Boxma, Vinod Sharma, D. K. Prasad