372 search results - page 64 / 75 » Mining the space of graph properties |
192
click to vote
NIPS
2004
15 years 7 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...
189
click to vote
IWCIA
2009
Springer
16 years 18 days 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...
175
click to vote
SSS
2007
Springer
16 years 4 days 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...
145
click to vote
RSA
2010
15 years 4 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...
162
click to vote
SDM
2009
SIAM
16 years 3 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...