111 search results - page 14 / 23 » The Complexity of Local List Decoding |
111
click to vote
PAMI
2006
15 years 10 days ago
2006
In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: en...
124
click to vote
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
Intra prediction has been efficiently employed in block based image/video coding to remove the spatial redundancy. In this paper, we propose a position dependent linear intra pred...
115
click to vote
SIGMETRICS
2008
ACM
15 years 10 days ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
91
Voted
ANOR
2010
15 years 16 days ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
125
Voted
CATA
2000
15 years 1 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...