102 search results - page 13 / 21 » An Improved Zero-One Law for Algorithmically Random Sequence... |
141
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
121
click to vote
ALMOB
2006
15 years 3 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
153
click to vote
MM
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents an efficient approach for copies detection in a large videos archive consisting of several hundred of hours. The video content indexing method consists of ext...
146
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
142
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...