1034 search results - page 33 / 207 » Wide Classes |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
ACTAC
2002
13 years 8 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
SCHEDULING
2010
13 years 7 months ago
2010
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
ICASSP
2011
IEEE
13 years 11 days ago
2011
IEEE
This paper applies affinity propagation (AP) to develop distributed solutions for routing over networks. AP is a message passing algorithm for unsupervised learning. This paper d...
VISUALIZATION
2005
IEEE
14 years 2 months ago
2005
IEEE
The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolu...