Sciweavers

289 search results - page 19 / 58
» Node similarity in the citation graph
Sort
View
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
CVIU
2006
105views more  CVIU 2006»
13 years 7 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 2 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
ICPR
2008
IEEE
14 years 8 months ago
Similarity-based matching for face authentication
We propose in this paper a face authentication method based on a similarity measure. The SIFT descriptor is used to define some interest keypoints characterized by an invariant pa...
Christophe Rosenberger, Luc Brun
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 9 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen