5511 search results - page 347 / 1103 » Security for Network Places |
146
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
142
Voted
GD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
179
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The paper proposes an ancient landscape design as an example of graphic design for an age and place where no written documents existed. It is created by a network of earthworks, w...
191
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
–The many-to-one traffic pattern dominates in sensor networks, where a large number of sensor nodes send data to one sink. A sensor node may only communicate with a small portion...
152
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
In recent years, it has become important for researchers, security incident responders and educators to share network logs, and many log anonymization tools and techniques have be...