401 search results - page 53 / 81 » Sparse Quasi-Random Graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
IM
2008
13 years 7 months ago
2008
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
JCP
2006
13 years 7 months ago
2006
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
SIAMDM
2000
13 years 7 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Peer-to-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find cont...