4886 search results - page 159 / 978 » Approximate Data Exchange |
172
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
178
click to vote
FQAS
2009
Springer
16 years 21 days ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
147
Voted
IWANN
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...
157
Voted
VMCAI
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
150
Voted
STOC
1996
ACM
15 years 10 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...