Sciweavers

81 search results - page 16 / 17
» Estimating and Sampling Graphs with Multidimensional Random ...
Sort
View
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
14 years 5 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
PVLDB
2010
220views more  PVLDB 2010»
13 years 1 days ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
SIGGRAPH
1997
ACM
13 years 9 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
AMAI
2004
Springer
13 years 10 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
INFOCOM
2005
IEEE
13 years 11 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik