1538 search results - page 239 / 308 » Spectral Techniques in Graph Algorithms |
112
click to vote
CIKM
2011
Springer
14 years 1 months ago
2011
Springer
We study the problem of detecting coordinated free text campaigns in large-scale social media. These campaigns – ranging from coordinated spam messages to promotional and advert...
127
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
114
click to vote
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
139
click to vote
ASPLOS
2008
ACM
15 years 3 months ago
2008
ACM
The recent shift in the industry towards chip multiprocessor (CMP) designs has brought the need for multi-threaded applications to mainstream computing. As observed in several lim...
141
click to vote
PASTE
2010
ACM
15 years 6 months ago
2010
ACM
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...