Sciweavers

2137 search results - page 162 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
124
Voted
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
15 years 8 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
CVPR
2004
IEEE
16 years 4 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen
124
Voted
IM
2007
15 years 2 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
102
Voted
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 2 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
117
Voted
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 8 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim