213 search results - page 25 / 43 » Counting Independent Sets Using the Bethe Approximation |
106
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
106
click to vote
AAECC
2006
Springer
14 years 12 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
100
click to vote
CAD
2005
Springer
14 years 11 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
100
click to vote
ALENEX
2008
15 years 1 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
180
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...