Sciweavers

2089 search results - page 88 / 418
» A New Problem in String Searching
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
FPGA based architecture for DNA sequence comparison and database search
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Euripides Sotiriades, Christos Kozanitis, Apostolo...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 10 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
15 years 4 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg
ATAL
2008
Springer
14 years 12 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
FIMI
2003
210views Data Mining» more  FIMI 2003»
14 years 11 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj