860 search results - page 52 / 172 » Biased Random Walks |
FOCS
2002
IEEE
14 years 4 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
COMPGEOM
2003
ACM
14 years 4 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
CPC
1998
13 years 10 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
WACV
2005
IEEE
14 years 4 months ago
2005
IEEE
— This paper describes a new method to improve inertial navigation using feature-based constraints from one or more video cameras. The proposed method lengthens the period of tim...
JSAC
2010
13 years 5 months ago
2010
Abstract--Wireless sensor networks (WSNs) deployed in hostile environments are vulnerable to clone attacks. In such attack, an adversary compromises a few nodes, replicates them, a...