Sciweavers

174 search results - page 6 / 35
» Fast equation automaton computation
Sort
View
105
Voted
CVPR
2006
IEEE
15 years 1 months ago
Accurate Tracking of Monotonically Advancing Fronts
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
M. Sabry Hassouna, Aly A. Farag
77
Voted
JCPHY
2011
87views more  JCPHY 2011»
14 years 12 days ago
A fast directional algorithm for high-frequency electromagnetic scattering
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
Paul Tsuji, Lexing Ying
98
Voted
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 9 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
81
Voted
ICCS
2007
Springer
15 years 1 months ago
Fourier Spectral Solver for the Incompressible Navier-Stokes Equations with Volume-Penalization
In this study we use a fast Fourier spectral technique to simulate the Navier-Stokes equations with no-slip boundary conditions. This is enforced by an immersed boundary technique ...
G. H. Keetels, H. J. H. Clercx, G. J. F. van Heijs...
FOCS
2002
IEEE
15 years 2 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich