1191 search results - page 65 / 239 » Completeness and Performance Of The APO Algorithm |
142
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
161
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
125
click to vote
TNN
1998
15 years 2 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
103
click to vote
DSN
2004
IEEE
15 years 6 months ago
2004
IEEE
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual com...
118
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...