Sciweavers

860 search results - page 54 / 172
» Biased Random Walks
Sort
View
FOCS
2009
IEEE
14 years 5 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICRA
2010
IEEE
202views Robotics» more  ICRA 2010»
13 years 9 months ago
A robust state estimation method against GNSS outage for unmanned miniature helicopters
Abstract— Most unmanned aerial robots use a Global Navigation Satellite System (GNSS), such as GPS, GLONASS, and Galileo, for their navigation. However, from time to time the GNS...
Tak-Kit Lau, Yun-hui Liu, Kai-wun Lin
FOCS
1999
IEEE
14 years 3 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
ESANN
2007
14 years 13 days ago
Human motion recognition using Nonlinear Transient Computation
A novel approach to human motion recognition is proposed that is based on a variation of the Nonlinear Transient Computation Machine (NTCM). The motion data used to train the NTCM ...
Nigel Crook, Wee Jin Goh
TCS
2010
13 years 5 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...