2994 search results - page 93 / 599 » Time sequences |
99
Voted
NDSS
2006
IEEE
15 years 6 months ago
2006
IEEE
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The resulting platforms provide computational power pre...
119
click to vote
CIKM
2004
Springer
15 years 6 months ago
2004
Springer
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
ICPP
2003
IEEE
15 years 6 months ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
108
click to vote
FATES
2003
Springer
15 years 6 months ago
2003
Springer
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...