6142 search results - page 67 / 1229 » The Complexity of Partition Functions |
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
As a key part of universal source coding, context quantization is very important for improving compression performance. However, in most existing methods, the quantizer is trained...
IJCAI
2007
14 years 11 months ago
2007
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
101
click to vote
GC
2007
Springer
14 years 9 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propo...
SIGECOM
2008
ACM
14 years 9 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...