Sciweavers

2957 search results - page 218 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
CEC
2007
IEEE
15 years 8 months ago
Multi-population approach to approximate the development of neocortical networks
— Cultured natural cortical neurons form functional networks through a complex set of developmental steps during the first weeks in vitro. The dynamic behavior of the network in...
Andreas Herzog, Karsten Kube, Bernd Michaelis, Ana...
ICASSP
2008
IEEE
16 years 1 months ago
Factorized variational approximations for acoustic multi source localization
Estimation based on received signal strength (RSS) is crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present a Gaussian approximation ...
Volkan Cevher, Aswin C. Sankaranarayanan, Rama Che...
JSC
2008
162views more  JSC 2008»
15 years 6 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
ACL
1997
15 years 8 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
FOCS
2004
IEEE
15 years 10 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev