227 search results - page 20 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper develops a mechanism for detecting session hijacking attacks in wireless networks. The proposed scheme is based on detecting abrupt changes in the strength of the re...
SIROCCO
2010
13 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
SIAMCOMP
2000
13 years 7 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...