Sciweavers

239 search results - page 23 / 48
» Passage time distributions in large Markov chains
Sort
View
ICRA
2007
IEEE
147views Robotics» more  ICRA 2007»
15 years 4 months ago
Fixed-lag Sampling Strategies for Particle Filtering SLAM
— We describe two new sampling strategies for Rao-Blackwellized particle filtering SLAM. The strategies, called fixed-lag roughening and the block proposal distribution, both e...
Kristopher R. Beevers, Wesley H. Huang
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
15 years 3 months ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...
FOCS
2008
IEEE
15 years 4 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
TOMACS
2011
139views more  TOMACS 2011»
14 years 4 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
EGPGV
2004
Springer
175views Visualization» more  EGPGV 2004»
15 years 3 months ago
Interactive Parallel Visualization of Large Particle Datasets
This paper presents a new interactive parallel method for direct visualization of large particle datasets. Based on a parallel rendering cluster, a frame rate of 9 frames-per-seco...
Kevin Liang, Patricia Monger, Huge Couchman