Sciweavers

375 search results - page 51 / 75
» An Algorithm to Find Overlapping Community Structure in Netw...
Sort
View
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
CVPR
2009
IEEE
15 years 2 months ago
Monitoring, Recognizing and Discovering Social Networks
This work addresses the important problem of the discovery and analysis of social networks from surveillance video. A computer vision approach to this problem is made possible b...
Ting Yu, Ser Nam Lim, Kedar A. Patwardhan, Nils Kr...
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 7 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
BIOWIRE
2007
Springer
14 years 1 months ago
Epcast: Controlled Dissemination in Human-Based Wireless Networks Using Epidemic Spreading Models
Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabili...
Salvatore Scellato, Cecilia Mascolo, Mirco Musoles...
IPPS
2005
IEEE
14 years 1 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader