Sciweavers

10602 search results - page 155 / 2121
» Weakly Useful Sequences
Sort
View
ISMB
1998
15 years 5 months ago
Sequence Assembly Validation by Multiple Restriction Digest Fragment Coverage Analysis
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. This report examines the possibility of analyzing multiple,...
Eric C. Rouchka, David J. States
121
Voted
DAM
2007
67views more  DAM 2007»
15 years 4 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh
ICPR
2008
IEEE
15 years 10 months ago
Subject-independent brain computer interface through boosting
This paper presents a subject-independent EEG (Electroencephalogram) classification technique and its application to a P300-based word speller. Due to EEG variations across subje...
Shijian Lu, Cuntai Guan, Haihong Zhang
ICALP
1998
Springer
15 years 8 months ago
A Hierarchy of Equivalences for Asynchronous Calculi
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
Cédric Fournet, Georges Gonthier
ICISC
2001
132views Cryptology» more  ICISC 2001»
15 years 5 months ago
Slide Attacks with a Known-Plaintext Cryptanalysis
Although many strong cryptanalytic tools exploit weaknesses in the data-randomizinig part of a block cipher, relatively few general tools for cryptanalyzing on the other part, the ...
Soichi Furuya