5606 search results - page 415 / 1122 » Randomization Techniques for Graphs. |
308
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
163
click to vote
ACSAC
2005
IEEE
16 years 10 days ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
196
click to vote
INFOVIS
1997
IEEE
15 years 11 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
144
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
151
click to vote
FASE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...