Sciweavers

2100 search results - page 144 / 420
» Learning to rank on graphs
Sort
View
WWW
2004
ACM
16 years 7 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
16 years 1 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
15 years 6 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts
BMCBI
2008
138views more  BMCBI 2008»
15 years 6 months ago
Novel implementation of conditional co-regulation by graph theory to derive co-expressed genes from microarray data
Background: Most existing transcriptional databases like Comprehensive Systems-Biology Database (CSB.DB) and Arabidopsis Microarray Database and Analysis Toolbox (GENEVESTIGATOR) ...
Arun Rawat, Georg J. Seifert, Youping Deng
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 6 months ago
The Induced Subgraph Order on Unlabelled Graphs
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Craig A. Sloss