Sciweavers

2735 search results - page 57 / 547
» Comparing notions of randomness
Sort
View
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
14 years 3 months ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
ECCV
2008
Springer
14 years 7 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
14 years 17 days ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
CVPR
2004
IEEE
14 years 17 days ago
Self Shadowing and Local Illumination of Randomly Rough Surfaces
This paper develops an analytic model for self shadowing and local illumination of rough surfaces. The surface is assumed homogeneous, isotropic, and smooth microscopically, with ...
Yinlong Sun
CSDA
2010
124views more  CSDA 2010»
13 years 9 months ago
Statistical inference on attributed random graphs: Fusion of graph features and content
Abstract: Fusion of information from graph features and content can provide superior inference for an anomaly detection task, compared to the corresponding content-only or graph fe...
John Grothendieck, Carey E. Priebe, Allen L. Gorin