Sciweavers

1279 search results - page 20 / 256
» Fast Implementations of Automata Computations
Sort
View
TSP
2010
13 years 2 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
13 years 12 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
14 years 2 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif
ICASSP
2011
IEEE
12 years 11 months ago
On spatio-temporal Tomlinson Harashima Precoding in IIR channels: MMSE solution, properties, and fast computation
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
Sander Wahls, Holger Boche
SIGGRAPH
1994
ACM
13 years 11 months ago
Fast contact force computation for nonpenetrating rigid bodies
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
David Baraff