Sciweavers

2354 search results - page 182 / 471
» Randomness, Stochasticity and Approximations
Sort
View
COLCOM
2007
IEEE
13 years 11 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen
DPHOTO
2010
195views Hardware» more  DPHOTO 2010»
13 years 11 months ago
Direct PSF estimation using a random noise target
Conventional point spread function (PSF) measurement methods often use parametric models for the estimation of the PSF. This limits the shape of the PSF to a specific form provide...
Johannes Brauers, Claude Seiler, Til Aach
AAAI
1998
13 years 11 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
WSC
1997
13 years 11 months ago
How Common Random Numbers Affect Multinomial Selection
We consider the effect of common random numbers (CRNs) among simulated systems in two different multinomial selection procedures; the classical procedure BEM (Bechhofer, Elmaghr...
John O. Miller, Kenneth W. Bauer Jr.
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Estimation with Random Linear Mixing, Belief Propagation and Compressed Sensing
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
Sundeep Rangan