81 search results - page 6 / 17 » Bounding the Partition Function of Spin-Systems |
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
INFOCOM
2003
IEEE
14 years 19 days ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
IACR
2011
12 years 7 months ago
2011
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...