8431 search results - page 376 / 1687 » Algorithmically Independent Sequences |
140
click to vote
ISCAS
1995
IEEE
15 years 10 months ago
1995
IEEE
We describe an algorithm and chip implementation for separating a mixture of unknown, but independent, temporal signals in static and dynamic environments. The proposed algorithm,...
181
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
138
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
152
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
191
click to vote
ACISICIS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a modified K-means algorithm that can be used for removing noise in multicolor motion capture image sequences. These images have been produced using the Illumi...