153 search results - page 15 / 31 » On the Optimal Compression of Sets in PSPACE |
177
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
196
click to vote
COCO
2005
Springer
15 years 11 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...
168
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
209
click to vote
PPOPP
2011
ACM
14 years 8 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
181
click to vote
BIRTHDAY
2009
Springer
16 years 24 days ago
2009
Springer
Research into embedded sensor networks has placed increased focus on the problem of developing reliable and flexible software for microcontroller-class devices. Languages such as ...