114 search results - page 11 / 23 » The Covert Set-Cover Problem with Application to Network Dis... |
ICDCS
2005
IEEE
14 years 29 days ago
2005
IEEE
Large-scale competitive P2P networks are threatened by the noncooperation problem,1 where peers do not forward queries to potential competitors. Non-cooperation will be a growing ...
IDA
2011
Springer
13 years 2 months ago
2011
Springer
Ubiquitous Knowledge Discovery is a new research area at the intersection of machine learning and data mining with mobile and distributed systems. In this paper the main character...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
—The need to monitor groups of mobile entities arises in many application contexts. Examples include the study of the social behavior of humans and wildlife, the shepherding of l...
PERCOM
2006
ACM
14 years 7 months ago
2006
ACM
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...