Sciweavers

2069 search results - page 17 / 414
» Linear time algorithms for Clobber
Sort
View
112
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Linear time decoding of real-field codes over high error rate channels
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
Zaixing He, Takahiro Ogawa, Miki Haseyama
160
Voted
LATIN
2010
Springer
15 years 10 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
127
Voted
DCC
2008
IEEE
16 years 3 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
123
Voted
DCC
2009
IEEE
16 years 4 months ago
Linear Suffix Array Construction by Almost Pure Induced-Sorting
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
Ge Nong, Sen Zhang, Wai Hong Chan
154
Voted
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 1 months ago
Switching time estimation for linear switched systems: an algebraic approach
This paper aims at estimating the switching time for linear switched systems, i.e. the time instant when a sub-model is switched on while another one is switched off. Assuming that...
Yang Tian, Thierry Floquet, Lotfi Belkoura, Wilfri...