119 search results - page 13 / 24 » On the Complexity of Optimal Grammar-Based Compression |
COCO
2005
Springer
14 years 1 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
ICMCS
2008
IEEE
14 years 1 months ago
2008
IEEE
H.264/scalable video coding (SVC) is a new compression technique that can adapt to various network environments and applications. However, despite its outstanding performance, H.2...
IEEECIT
2006
IEEE
14 years 1 months ago
2006
IEEE
For the low bit rate (LBR) video communications, LBR transcoding is performed by the transcoder to match the network bandwidth and the performance of the client. One of typical tr...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...