17760 search results - page 213 / 3552 » A Generalization of the Massey-Ding Algorithm |
167
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a dense sampling S of the smooth boundary of a planar shape O. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particu...
132
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
Computational resolution enhancement (superresolution) is generally regarded as a memory intensive process due to the large matrix-vector calculations involved. In this paper, a de...
169
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
152
click to vote
DAM
2008
15 years 6 months ago
2008
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by B
164
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...