229 search results - page 20 / 46 » Speeding Up Two String-Matching Algorithms |
PAKDD
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
101
click to vote
BIBE
2010
IEEE
14 years 6 months ago
2010
IEEE
We propose an algorithm that predicts potentially missing Gene Ontology annotations, in order to speed up the time-consuming annotation curation process. The proposed method extend...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
The parallelization of two applications in symmetric cryptography is considered: block ciphering and a new method based on random sampling for the selection of basic substitution ...
73
Voted
ICDCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...