372 search results - page 64 / 75 » Mining the space of graph properties |
NIPS
2004
13 years 9 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
IWCIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
SSS
2007
Springer
14 years 2 months ago
2007
Springer
We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay netwo...
RSA
2010
13 years 6 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
The focus of this paper is the discovery of anomalous spatio-temporal windows. We propose a Discretized SpatioTemporal Scan Window approach to address the question of how we can t...