Sciweavers

817 search results - page 84 / 164
» Decoding Choice Encodings
Sort
View
COLT
1999
Springer
14 years 2 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
SIBGRAPI
2006
IEEE
14 years 4 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
GG
2004
Springer
14 years 3 months ago
Translating Java Code to Graph Transformation Systems
We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules incl...
Andrea Corradini, Fernando Luís Dotti, Luci...
IFIP
2004
Springer
14 years 3 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
ICC
2009
IEEE
176views Communications» more  ICC 2009»
14 years 4 months ago
Error Resilient Non-Asymmetric Slepian-Wolf Coding
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
Cédric Herzet, Velotiaray Toto-Zarasoa, Ali...