Sciweavers

1722 search results - page 18 / 345
» On the sample mean of graphs
Sort
View
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
15 years 4 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
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...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
ICPR
2008
IEEE
15 years 4 months ago
Layered shape matching and registration: Stochastic sampling with hierarchical graph representation
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
Xiaobai Liu, Liang Lin, Hongwei Li, Hai Jin, Wenbi...
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 4 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
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...
Zhenhai Zhu, Joel R. Phillips
CORR
2008
Springer
110views Education» more  CORR 2008»
14 years 10 months ago
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
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),...
Ashish Goel, Michael Kapralov, Sanjeev Khanna
CPC
2007
64views more  CPC 2007»
14 years 10 months ago
Sampling Regular Graphs and a Peer-to-Peer Network
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...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...