Sciweavers

2626 search results - page 105 / 526
» The complexity of stochastic sequences
Sort
View
ICPP
2007
IEEE
16 years 13 days ago
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Ch...
138
Voted
DAGSTUHL
2006
15 years 7 months ago
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
Alexander E. Andreev
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 6 months ago
New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
Zilong Wang, Guang Gong
158
Voted
ICPP
1999
IEEE
15 years 10 months ago
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
Jim Nilsson, Fredrik Dahlgren
174
Voted
TCS
1998
15 years 5 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz