1067 search results - page 94 / 214 » Probabilistic regular graphs |
126
click to vote
WG
1993
Springer
15 years 7 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
109
click to vote
GC
2010
Springer
15 years 1 months ago
2010
Springer
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
129
click to vote
ICALP
1992
Springer
15 years 7 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
136
click to vote
IBERAMIA
2010
Springer
15 years 1 months ago
2010
Springer
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional depe...
121
click to vote
PVLDB
2010
15 years 1 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...