6045 search results - page 188 / 1209 » Computable Linearizations of Well-partial-orderings |
129
click to vote
ISCAS
2007
IEEE
15 years 10 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...
143
click to vote
TIT
2011
14 years 11 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 ...
141
click to vote
RECOMB
2009
Springer
15 years 11 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...
139
click to vote
SI3D
2003
ACM
15 years 9 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...
153
click to vote
SI3D
2010
ACM
15 years 11 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...