4714 search results - page 291 / 943 » The Complexity of Iterated Multiplication |
182
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
168
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
178
click to vote
CGF
1999
15 years 6 months ago
1999
This paper describes the successful combination of pre-generated and dynamically updated image-based representations to accelerate the visualization of complex virtual environment...
152
click to vote
ICDAR
2009
IEEE
16 years 1 months ago
2009
IEEE
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
162
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Consider a flat-fading Multiple-Input Multiple-Output (MIMO) system. The near-optimum detection problematic has been shown to be efficiently solved through QR Decomposition (QRD...