8431 search results - page 369 / 1687 » Algorithmically Independent Sequences |
183
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
158
click to vote
DASFAA
2006
IEEE
16 years 26 days ago
2006
IEEE
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
179
click to vote
GECCO
2007
Springer
16 years 29 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
200
click to vote
BIBE
2007
IEEE
16 years 1 months ago
2007
IEEE
-We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a...
160
click to vote
VTC
2006
IEEE
16 years 25 days ago
2006
IEEE
Abstract— This paper addresses Tomlinson-Harashima Precoding (THP) for the downlink of multiuser systems, where the transmitter is equipped with multiple antennas and each decent...