<--- Back to Details
First PageDocument Content
Parallel computing / Cheminformatics / Computational chemistry / NP-complete problems / Data mining / Graph theory / Subgraph isomorphism problem / Parallel algorithm / Association rule learning / Theoretical computer science / Computing / Applied mathematics
Date: 2010-11-08 10:09:34
Parallel computing
Cheminformatics
Computational chemistry
NP-complete problems
Data mining
Graph theory
Subgraph isomorphism problem
Parallel algorithm
Association rule learning
Theoretical computer science
Computing
Applied mathematics

C:/KN-WORK/WORK/DiMoFa05/conferences/IASTED-PDCS/CR/difatta.dvi

Add to Reading List

Source URL: www.inf.uni-konstanz.de

Download Document from Source Website

File Size: 121,83 KB

Share Document on Facebook

Similar Documents

Int. J. Advanced Networking and Applications Volume: 03, Issue: 01, Pages: 991 An Efficient Parallel Algorithm of Modified

DocID: 1vlzP - View Document

3 Bit-parallel string matching We will discuss • Shift-Or algorithm • Ukkonens algorithm for k-differences matching • Myers’ bit vector algorithm This exposition has been developed by C. Gropl,

DocID: 1uIUK - View Document

Parallel Trust Region Policy Optimization with Multiple Actors Kevin Frans, Danijar Hafner September 2016 Abstract We show a method for parallelizing the Trust Region Policy Optimization algorithm, using

DocID: 1uFBJ - View Document

Preimage search using low communication cost parallel Grover algorithm Gustavo Banegas1 and Daniel J. Bernstein1,2 Crypto Working Group September 8, 2017

DocID: 1uuAN - View Document

PATTERN IDENTIFICATION OF TIME SERIES EVENTS: A PARALLEL GENETIC ALGORITHM APPROACH Stellios Keskinidis Bachelor of Information Technology, Honours

DocID: 1unAZ - View Document