Sciweavers

3630 search results - page 268 / 726
» Fast Marching Methods
Sort
View
JSCIC
2006
98views more  JSCIC 2006»
15 years 6 months ago
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
Sigal Gottlieb, Steven J. Ruuth
PR
2008
90views more  PR 2008»
15 years 6 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
PR
2006
122views more  PR 2006»
15 years 6 months ago
Fast multiscale clustering and manifold identification
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
Dan Kushnir, Meirav Galun, Achi Brandt
SIAMSC
2008
127views more  SIAMSC 2008»
15 years 6 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
TIT
2008
74views more  TIT 2008»
15 years 6 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz