2100 search results - page 358 / 420 » Learning to rank on graphs |
127
click to vote
PLDI
2011
ACM
14 years 4 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
245
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
128
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In analyzing data from social and communication networks, we encounter the problem of classifying objects where there is an explicit link structure amongst the objects. We study t...
117
click to vote
RECOMB
2003
Springer
16 years 2 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
113
click to vote
WWW
2010
ACM
15 years 9 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...