Results 1  10
of
2,109
An iterative method for the solution of the eigenvalue problem of linear differential and integral
, 1950
"... The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the ..."
Abstract

Cited by 537 (0 self)
 Add to MetaCart
The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through
A theory of memory retrieval
 PSYCHOL. REV
, 1978
"... A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes sympath ..."
Abstract

Cited by 769 (83 self)
 Add to MetaCart
sympathetic vibrations in other tuning forks. Evidence is accumulated in parallel from each probememory item comparison, and each comparison is modeled by a continuous random walk process. In item recognition, the decision process is selfterminating on matching comparisons and exhaustive on nonmatching
Distributing tokens on a hypercube without error accumulation
 in Proceedings of the 1996 International Parallel Processing Symposium
, 1996
"... The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially each of the p nodes stores up to m tokens. A sample algorithm is presented operating in time O(1ogp + m. log logp) o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially each of the p nodes stores up to m tokens. A sample algorithm is presented operating in time O(1ogp + m. log logp) on average. 1
Abstract Computational Biology and Chemistry xxx (2006) xxx–xxx A quantitative model of error accumulation during PCR amplification
, 2005
"... The amplification of target DNA by the polymerase chain reaction (PCR) produces copies which may contain errors. Two sources of errors are associated with the PCR process: (1) editing errors that occur during DNA polymerasecatalyzed enzymatic copying and (2) errors due to DNA thermal damage. In thi ..."
Abstract
 Add to MetaCart
stranded form. The proposed quantitative model predicts the accumulation of errors over the course of a PCR cycle. Thermal damage contributes significantly to the total errors; therefore consideration must be given to thermal management of the PCR process.
Twostate system driven by imperfect π pulses: an estimate of the error accumulation in bangbang control methods
, 2000
"... The evolution of a twostate system driven by a sequence of imperfect π pulses (with random phase or amplitude errors) is calculated. The resulting decreased fidelity is used to derive a plausible limit on the performance of ”bangbang ” control methods for the suppression of decoherence. Typeset us ..."
Abstract
 Add to MetaCart
The evolution of a twostate system driven by a sequence of imperfect π pulses (with random phase or amplitude errors) is calculated. The resulting decreased fidelity is used to derive a plausible limit on the performance of ”bangbang ” control methods for the suppression of decoherence. Typeset
The Bits and Flops of the Nhop Multilateration Primitive For Node Localization Problems
, 2002
"... The recent advances in MEMS, embedded systems and wireless communication technologies are making the realization and deployment of networked wireless microsensors a tangible task. Vital to the success of wireless microsensor networks is the ability of microsensors to "collectively perform sensi ..."
Abstract

Cited by 280 (2 self)
 Add to MetaCart
hops away and distance measurements to neighboring nodes. To prevent error accumulation in the network, node locations are computed by setting up and solving a global nonlinear optimization problem. The solution is presented in two computation models, centralized and a fully distributed approximation
Tractable inference for complex stochastic processes
 In Proc. UAI
, 1998
"... The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system, these tasks typically involve the use of a belief state—a probability distribution over the state of the process at a gi ..."
Abstract

Cited by 302 (14 self)
 Add to MetaCart
is intractable. We investigate the idea of maintaining a compact approximation to the true belief state, and analyze the conditions under which the errors due to the approximations taken over the lifetime of the process do not accumulate to make our answers completely irrelevant. We show that the error in a
Faulttolerant quantum computation
 In Proc. 37th FOCS
, 1996
"... It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information i ..."
Abstract

Cited by 264 (5 self)
 Add to MetaCart
in a superposition of states in a quantum computer, making long computations impossible. A further difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering long computations unreliable. However, these obstacles may not be as formidable
Adaptive Finite Element Methods For Parabolic Problems. VI. Analytic Semigroups
 SIAM J. Numer. Anal
, 1998
"... . We continue our work on adaptive finite element methods with a study of time discretization of analytic semigroups. We prove optimal a priori and a posteriori error estimates for the discontinuous Galerkin method showing, in particular, that analytic semigroups allow longtime integration without ..."
Abstract

Cited by 215 (3 self)
 Add to MetaCart
error accumulation. 1. Introduction This paper is a continuation of the series of papers [1], [2], [3], [4], [5] on adaptive finite element methods for parabolic problems. The method considered is the discontinuous Galerkin method (the dGmethod) based on a spacetime finite element discretization
unknown title
, 906
"... Geometric integrators for multiplicative viscoplasticity: analysis of error accumulation ..."
Abstract
 Add to MetaCart
Geometric integrators for multiplicative viscoplasticity: analysis of error accumulation
Results 1  10
of
2,109