4865 search results - page 655 / 973 » The Complexity of Graph Connectivity |
161
click to vote
ICICS
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents PCAV (Parallel Coordinates Attack Visualizer), a real-time visualization system for detecting large-scale Internet attacks including Internet worms, DDoS attack...
183
Voted
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...
120
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
150
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
160
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...