Sciweavers

4315 search results - page 56 / 863
» Sorting in linear time
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
GLOBECOM
2009
IEEE
13 years 11 months ago
Near-Shannon-Limit Linear-Time-Encodable Nonbinary Irregular LDPC Codes
—In this paper, we present a novel method to construct nonbinary irregular LDPC codes whose parity check matrix has only column weights of 2 and t, where t ≥ 3. The constructed...
Jie Huang, Shengli Zhou, Peter Willett
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 9 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
COLING
2008
13 years 9 months ago
Extracting Synchronous Grammar Rules From Word-Level Alignments in Linear Time
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
Hao Zhang, Daniel Gildea, David Chiang
ESANN
1998
13 years 9 months ago
Recurrent SOM with local linear models in time series prediction
Recurrent Self-Organizing Map (RSOM) is studied in three di erent time series prediction cases. RSOM is used to cluster the series into local data sets, for which corresponding lo...
Timo Koskela, Markus Varsta, Jukka Heikkonen, Kimm...