350 search results - page 10 / 70 » Lower bounds and heuristic algorithms for the k |
FAW
2009
Springer
14 years 1 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
ML
2007
ACM
13 years 8 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
SIGECOM
2008
ACM
13 years 8 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...
TIT
1998
13 years 8 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...