1243 search results - page 68 / 249 » Complexity reduction of C-Algorithm |
104
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
132
click to vote
CCECE
2006
IEEE
15 years 7 months ago
2006
IEEE
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
150
click to vote
INTERSPEECH
2010
14 years 8 months ago
2010
A new recurrent neural network based language model (RNN LM) with applications to speech recognition is presented. Results indicate that it is possible to obtain around 50% reduct...
COCO
2009
Springer
15 years 5 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...