10146 search results - page 125 / 2030 » Fast FAST |
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Because each golden code codeword conveys four information symbols from an -ary QAM alphabet, the complexity of an exhaustive-search decoder is proportional to 4 . In this paper we...
100
Voted
ENTCS
2008
15 years 2 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
119
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
95
Voted
IPL
2008
15 years 2 months ago
2008
Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are start...
102
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indi...