14 search results - page 1 / 3 » Discrete Random Walks on One-Sided "Periodic" Grap... |
DRW
2003
14 years 7 days ago
2003
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
PAMI
2006
13 years 10 months ago
2006
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
ICPR
2006
IEEE
14 years 12 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...