An efficient closest point search algorithm, based on the Schnorr-Euchner (1995) variation of the Pohst (1981) method, is implemented and is shown to be substantially faster than other known methods.Expand

This work defines principal curves as continuous curves of a given length which minimize the expected squared distance between the curve and points of the space randomly chosen according to a given distribution, making it possible to theoretically analyze principal curve learning from training data and it also leads to a new practical construction.Expand

A progressive image compression scheme whose performance on a noisy channel is significantly better than that of previously known techniques and effectively no degradation due to channel noise can be detected.Expand

The Vamos network is constructed, and it is proved that Shannon-type information inequalities are insufficient even for computing network coding capacities of multiple-unicast networks.Expand

A progressive image compression scheme whose performance on a noisy channel is significantly better than that of previously known techniques and effectively no degradation due to channel noise can be detected.Expand

This work cascade an existing image coder with carefully chosen error control coding, and thus produces a progressive image compression scheme whose performance on a noisy channel is significantly better than that of previously known image compression techniques.Expand

A product channel code is proposed to protect progressively compressed and packetized image data that is transmitted across noisy channels and performs well on fading channels.Expand

A lower bound on the probability of symbol error for maximum-likelihood decoding of lattices and lattice codes on a Gaussian channel is presented and it is shown that the effective coding gains of the densest known lattices are much lower than their nominal coding gains.Expand

It is shown that the network coding capacity of this counterexample network is strictly greater than the maximum linear coding capacity over any finite field, so the network is not even asymptotically linearly solvable.Expand

It is proved that there are essentially new inequalities at each number of variables beyond four (a result also proved recently by Kinser) and a list of 24 which, together with the Shannon and Ingleton inequalities, generate all linear rank inequalities on five variables is given.Expand