10988 search results - page 381 / 2198 » Algorithmic Folding Complexity |
86
Voted
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
130
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
— The fully parallel LDPC decoding architecture can achieve high decoding throughput, but it suffers from large hardware complexity caused by a large set of processing units and ...
143
click to vote
ISMIR
2004
Springer
15 years 10 months ago
2004
Springer
In the last few years, several algorithms for the automatic alignment of audio and score data corresponding to the same piece of music have been proposed. Among the major drawback...
139
Voted
AAAI
2007
15 years 7 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
165
click to vote
TWC
2008
2008
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
15 years 4 months ago
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...