Sciweavers

652 search results - page 53 / 131
» Linear Explicit Substitutions
Sort
View
DCC
2005
IEEE
14 years 8 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
DAGM
2009
Springer
14 years 3 months ago
Multi-view Object Detection Based on Spatial Consistency in a Low Dimensional Space
This paper describes a new approach for detecting objects based on measuring the spatial consistency between different parts of an object. These parts are pre-defined on a set of...
Gurman Gill, Martin Levine
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 10 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
CSC
2006
13 years 10 months ago
Applying Sparse Matrix Solvers to a Glacial Ice Sheet Model
- Two software packages for solving sparse systems of linear equations, SuperLU and UMFPACK, have been integrated with the University of Maine Ice Sheet Model for predicting the fo...
Rodney Jacobs, James Fastook, Aitbala Sargent
JMMA
2002
90views more  JMMA 2002»
13 years 8 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...