Sciweavers

1722 search results - page 95 / 345
» On the sample mean of graphs
Sort
View
CVPR
2009
IEEE
17 years 2 months ago
Robust Multi-Class Transductive Learning with Graphs
Graph-based methods form a main category of semisupervised learning, offering flexibility and easy implementation in many applications. However, the performance of these methods...
Wei Liu (Columbia University), Shih-fu Chang (Colu...
WWW
2009
ACM
16 years 7 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
CAAN
2004
Springer
16 years 8 days ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 11 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
CIKM
2009
Springer
16 years 1 months ago
Privacy-enhanced public view for social graphs
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
Hyoungshick Kim, Joseph Bonneau