1717 search results - page 261 / 344 » A Computable Spectral Theorem |
120
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...
152
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
124
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
117
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
241
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...