2969 search results - page 15 / 594 » A space efficient algorithm for group structure computation |
146
Voted
HIPEAC
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
107
click to vote
ICIP
1998
IEEE
16 years 4 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
127
Voted
JCB
2008
15 years 2 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
130
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
145
click to vote
ENTCS
2006
15 years 2 months ago
2006
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...