Sciweavers

2465 search results - page 117 / 493
» Automata on Linear Orderings
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 11 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
SIAMSC
2010
118views more  SIAMSC 2010»
13 years 3 months ago
Optimal Explicit Strong-Stability-Preserving General Linear Methods
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods ge...
Emil M. Constantinescu, Adrian Sandu
TCOM
2008
105views more  TCOM 2008»
13 years 9 months ago
High-rate diversity across time and frequency using linear dispersion
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
Jinsong Wu, Steven D. Blostein
JSCIC
2007
89views more  JSCIC 2007»
13 years 9 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
14 years 9 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...