9 search results - page 2 / 2 » The Spacey Random Walk: a Stochastic Process for Higher-orde... |
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
SPAA
2004
ACM
14 years 26 days ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
NIPS
2004
13 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
WACV
2005
IEEE
14 years 1 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...