1105 search results - page 151 / 221 » Linear choosability of graphs |
ICML
2007
IEEE
16 years 21 days ago
2007
IEEE
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
103
click to vote
WWW
2004
ACM
16 years 17 days ago
2004
ACM
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
116
click to vote
WWW
2003
ACM
16 years 17 days ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
126
click to vote
PODC
2009
ACM
16 years 13 days ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
100
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...