153 search results - page 5 / 31 » On the Optimal Compression of Sets in PSPACE |
STOC
1999
ACM
15 years 3 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
EACL
2006
ACL Anthology
15 years 25 days ago
2006
ACL Anthology
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a block-based transform optimization and associated image compression technique that exploits regularity along directional image singularities. Unlike established work,...
DAC
2000
ACM
16 years 12 days ago
2000
ACM
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...