1201 search results - page 137 / 241 » Linear Probing and Graphs |
111
Voted
COMCOM
2006
15 years 23 days ago
2006
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
115
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
129
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
162
Voted
SBBD
2008
15 years 2 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
120
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...