2944 search results - page 407 / 589 » Improving Bound Propagation |
175
click to vote
AIEDAM
2008
15 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
169
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper analyzes the Fourier model reduction (FMR) method from a rational Krylov projection framework and shows how the FMR reduced model, which has guaranteed stability and a ...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
175
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
184
click to vote
DM
2008
15 years 6 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...