Sciweavers

672 search results - page 95 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
CIDR
2011
188views Algorithms» more  CIDR 2011»
13 years 7 days ago
Managing Structured Collections of Community Data
Data management is becoming increasingly social. We observe a new form of information in such collaborative scenarios, where users contribute and reuse information, which resides ...
Wolfgang Gatterbauer, Dan Suciu
ATAL
2007
Springer
14 years 2 months ago
Physics inspired multiagent system for vehicle platooning
Since about two decades, many works have been made in order to provide solutions to the vehicle platoon problem. The main issue related to platoon systems consists in controling t...
Jean-Michel Contet, Franck Gechter, Pablo Gruer, A...
ACSAC
2010
IEEE
13 years 10 days 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
JSA
2000
115views more  JSA 2000»
13 years 8 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 9 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang