Sciweavers

174 search results - page 5 / 35
» Fast equation automaton computation
Sort
View
ACMSE
2006
ACM
15 years 3 months ago
Inductive bases and their application to searches for minimal unary NFAs
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
Geoffrey Smith
102
Voted
MICCAI
2010
Springer
14 years 8 months ago
Fast Ultrasound Image Simulation Using the Westervelt Equation
Abstract. The simulation of ultrasound wave propagation is of high interest in fields as ultrasound system development and therapeutic ultrasound. From a computational point of vi...
Athanasios Karamalis, Wolfgang Wein, Nassir Navab
92
Voted
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
15 years 3 months ago
Fast positive-real balanced truncation of symmetric systems using cross Riccati equations
We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a p...
Ngai Wong

Book
19360views
16 years 8 months ago
Numerical Recipes in C
C code implementation of several math algorithms such as Linear Algebraic Equations, Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
William H. Press, Saul A. Teukolsky, William T. Ve...
MOC
1998
96views more  MOC 1998»
14 years 9 months ago
A convergence theorem for the fast multipole method for 2 dimensional scattering problems
Abstract. The Fast Multipole Method (FMM) designed by V. Rokhlin rapidly computes the field scattered from an obstacle. This computation consists of solving an integral equation o...
Christophe Labreuche