646 search results - page 107 / 130 » Generalized connected domination in graphs |
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
AGILE
2009
Springer
14 years 3 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
SIGCOMM
2004
ACM
14 years 2 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
SP
1998
IEEE
14 years 27 days ago
1998
IEEE
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...