✦ LIBER ✦

Reconstructing Words from Subwords in Linear Time

✍ Scribed by Andreas W. M. Dress; Péter L. Erdős

Publisher: Springer
Year: 2005
Tongue: English
Weight: 146 KB
Volume: 8
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-004-0232-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstructing a Binary Tree from Its Tr

Reconstructing a Binary Tree from Its Traversals in Doubly Logarithmic CREW Time

✍ S. Olariu; M. Overstreet; Z.F. Wen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 508 KB

RECONSTRUCTION OF LINEAR AND NON-LINEAR

RECONSTRUCTION OF LINEAR AND NON-LINEAR CONTINUOUS-TIME SYSTEM MODELS FROM INPUT/OUTPUT DATA USING THE KERNEL INVARIANCE ALGORITHM

✍ S.A. BILLINGS; L.M. LI 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 260 KB

A new kernel invariance algorithm (KIA) is introduced to determine both the signi"cant model terms and estimate the unknown parameters in non-linear continuous-time di!erential equation models of unknown systems 2000 Academic Press

From Constrained to Unconstrained Maximu

From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time

✍ V. Berry; Z. S. Peng; H. F. Ting 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 507 KB

Resonance-like phenomena in Lyapunov cal

Resonance-like phenomena in Lyapunov calculations from data reconstructed by the time-delay method

✍ Jürgen Fell; Peter E. Beckmann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Dead time effects from linear amplifiers

Dead time effects from linear amplifiers and discriminators in single detector systems

✍ E. Funck 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 404 KB

From a simple elimination ordering to a

From a simple elimination ordering to a strong elimination ordering in linear time

✍ J. Sawada; J.P. Spinrad 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 81 KB

We present a linear time algorithm for transforming a simple elimination ordering of a strongly chordal graph into a strong elimination ordering.