Sciweavers

2424 search results - page 433 / 485
» A general algorithm for data dependence analysis
Sort
View
ACSAC
2010
IEEE
14 years 6 months ago
Friends of an enemy: identifying local members of peer-to-peer botnets using mutual contacts
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
Baris Coskun, Sven Dietrich, Nasir D. Memon
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 5 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 9 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
15 years 1 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
16 years 3 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...