Sciweavers

521 search results - page 8 / 105
» Coring method for clustering a graph
Sort
View
KAIS
2011
129views more  KAIS 2011»
14 years 6 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
MVA
2007
137views Computer Vision» more  MVA 2007»
15 years 1 months ago
Fingerprint Core and Delta Detection by Candidate Analysis
This paper presents a new reliable detection of core and delta in fingerprints by candidate analysis. The line search based method, which is one of the reliable approaches to dete...
Tomohiko Ohtsuka, Daisuke Watanabe, Hiroyuki Aoki
SIGIR
2008
ACM
14 years 11 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
APVIS
2009
15 years 1 months ago
A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
Takayuki Itoh, Chris Muelder, Kwan-Liu Ma, Jun Ses...
GCC
2004
Springer
15 years 5 months ago
End Host Multicast for Peer-to-Peer Systems
Abstract. Multicast is an effective means for conducting the cooperative P2P communications. This paper studies an algorithm to construct a scalable and efficient end host multica...
Wanqing Tu, Weijia Jia