Sciweavers

715 search results - page 89 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
WAIM
2005
Springer
14 years 2 months ago
Research Paper Recommender Systems: A Subspace Clustering Approach
Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they c...
Nitin Agarwal, Ehtesham Haque, Huan Liu, Lance Par...
DIGITALCITIES
2003
Springer
14 years 2 months ago
World Digital Cities: Beyond Heterogeneity
This paper reviews worldwide activities on regional information spaces. In the US and Canada, a large number of community networks appeared in the early 1990s. As a platform for co...
Toru Ishida, Alessandro Aurigi, Mika Yasuoka
TCS
2010
13 years 3 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
MP
2011
13 years 3 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye