243 search results - page 22 / 49 » On randomized representations of graphs using short labels |
CPC
2010
13 years 4 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
ICPR
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...