241 search results - page 15 / 49 » Graphs, Hypergraphs and Hashing |
115
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
114
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
110
Voted
ICDM
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
97
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
122
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...