Sciweavers

52 search results - page 3 / 11
» Binary codes from the line graph of the n-cube
Sort
View
CGO
2011
IEEE
12 years 8 months ago
Flow-sensitive pointer analysis for millions of lines of code
—Many program analyses benefit, both in precision and performance, from precise pointer analysis. An important dimension of pointer analysis precision is flow-sensitivity, whic...
Ben Hardekopf, Calvin Lin
CGF
2010
157views more  CGF 2010»
13 years 4 months ago
Binary Shading Using Appearance and Geometry
In the style of binary shading, shape and illumination are depicted using two colors, typically black and white, that form coherent lines and regions in the image. We formulate th...
Bert Buchholz, Tamy Boubekeur, Doug DeCarlo, Marc ...
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 4 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 4 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
DCC
2006
IEEE
14 years 4 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford