2816 search results - page 47 / 564 » Submodular function minimization |
98
Voted
ICCAD
2001
IEEE
15 years 9 months ago
2001
IEEE
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
96
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
106
Voted
WWW
2007
ACM
16 years 1 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 ...
85
Voted
PVLDB
2010
14 years 11 months ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
90
Voted
ICALP
2009
Springer
16 years 22 days ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...