Sciweavers

375 search results - page 24 / 75
» An Algorithm to Find Overlapping Community Structure in Netw...
Sort
View
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 8 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
ICPR
2008
IEEE
14 years 2 months ago
Detecting hubs and quasi cliques in scale-free networks
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
Sriganesh Srihari, Hoong Kee Ng, Kang Ning, Hon Wa...
CIKM
2011
Springer
12 years 7 months ago
Structural link analysis and prediction in microblogs
With hundreds of millions of participants, social media services have become commonplace. Unlike a traditional social network service, a microblogging network like Twitter is a hy...
Dawei Yin, Liangjie Hong, Brian D. Davison
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...