Sciweavers

995 search results - page 37 / 199
» complexity 2011
Sort
View
134
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 9 months ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich
ICASSP
2011
IEEE
14 years 6 months ago
Least squares approximation and polyphase decomposition for pipelining recursive filters
Current techniques used in pipelining recursive filters require significant hardware complexity. These techniques attempt to preserve the exact frequency response of the origina...
Aditya Gupta, Andrew C. Singer, Naresh R. Shanbhag
105
Voted
ICASSP
2011
IEEE
14 years 6 months ago
On efficient soft-input soft-output encoding of convolutional codes
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
Andreas Winkelbauer, Gerald Matz
AGI
2011
14 years 6 months ago
Reinforcement Learning and the Bayesian Control Rule
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
Pedro Alejandro Ortega, Daniel Alexander Braun, Si...
204
Voted
ISSAC
2011
Springer
243views Mathematics» more  ISSAC 2011»
14 years 5 months ago
Practical polynomial factoring in polynomial time
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
William Hart, Mark van Hoeij, Andrew Novocin