1722 search results - page 18 / 345 » On the sample mean of graphs |
175
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
181
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
174
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
158
click to vote
CPC
2007
15 years 6 months ago
2007
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...