6045 search results - page 188 / 1209 » Computable Linearizations of Well-partial-orderings |
ISCAS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
TIT
2011
13 years 3 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
RECOMB
2009
Springer
14 years 3 months ago
2009
Springer
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
SI3D
2003
ACM
14 years 1 months ago
2003
ACM
Geometry deformations for interactive animated characters are most commonly achieved using a skeleton-driven deformation technique called linear blend skinning. To deform a vertex...
SI3D
2010
ACM
14 years 3 months ago
2010
ACM
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...