Sciweavers

4212 search results - page 314 / 843
» On Compressible Pairings and Their Computation
Sort
View
NIPS
2003
15 years 8 months ago
The IM Algorithm: A Variational Approach to Information Maximization
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...
David Barber, Felix V. Agakov
COMGEO
2006
ACM
15 years 6 months ago
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
Christopher Dyken, Michael S. Floater
CGF
2000
80views more  CGF 2000»
15 years 6 months ago
Context-based Space Filling Curves
A context-based scanning technique for images is presented. An image is scanned along a context-based space filling curve that is computed so as to exploit inherent coherence in t...
Revital Dafner, Daniel Cohen-Or, Yossi Matias
ACL
2010
15 years 4 months ago
Evaluating Machine Translations Using mNCD
This paper introduces mNCD, a method for automatic evaluation of machine translations. The measure is based on normalized compression distance (NCD), a general information theoret...
Marcus Dobrinkat, Tero Tapiovaara, Jaakko Väy...
ICCV
2011
IEEE
14 years 6 months ago
Dense Disparity Maps from Sparse Disparity Measurements
In this work we propose a method for estimating disparity maps from very few measurements. Based on the theory of Compressive Sensing, our algorithm accurately reconstructs dispar...
Simon Hawe, Martin Kleinsteuber, Klaus Diepold