1538 search results - page 216 / 308 » Spectral Techniques in Graph Algorithms |
125
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
: Network intrusion detection systems are themselves becoming targets of attackers. Alert flood attacks may be used to conceal malicious activity by hiding it among a deluge of fa...
143
click to vote
CORR
2010
Springer
15 years 2 days ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
165
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
114
click to vote
IPSN
2009
Springer
15 years 8 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...