Scalable frequent itemset mining on many-core processors

Συγγραφείς: Schlegel, Benjamin, Karnagel, Thomas, Kiefer, Tim, Lehner, Wolfgang

Πηγή: Schlegel, B, Karnagel, T, Kiefer, T & Lehner, W 2013, Scalable frequent itemset mining on many-core processors. in 9th International Workshop on Data Management on New Hardware, DaMoN 2013-In Conjunction with the ACM SIGMOD/PODS Conference., 3, 9th International Workshop on Data Management on New Hardware, DaMoN 2013-In Conjunction with the ACM SIGMOD/PODS Conference, 9th International Workshop on Data Management on New Hardware, DaMoN 2013-In Conjunction with the ACM SIGMOD/PODS Conference, New York, NY, United States, 24/06/2013. https://doi.org/10.1145/2485278.2485281

Θεματικοί όροι: ddc:004, Assoziationsregel-Mining-Prozess, effiziente sequentielle und parallele Algorithmen, Eclat-Algorithmus, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, association rule mining process, efficient sequential and parallel algorithms, Eclat algorithm

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/conf/damon/damon2013.html#SchlegelKKL13
https://dl.acm.org/doi/10.1145/2485278.2485281
https://dl.acm.org/citation.cfm?doid=2485278.2485281
https://tud.qucosa.de/id/qucosa:80649
https://tud.qucosa.de/api/qucosa:80649/attachment/ATT-0/

Edge-coloring and f-coloring for various classes of graphs: Edge-coloring and \(f\)-coloring for various classes of graphs

Συγγραφείς: Takao Nishizeki, Xiao Zhou

Πηγή: Lecture Notes in Computer Science ISBN: 9783540583257
Graph Algorithms and Applications I ISBN: 9789810249267

Θεματικοί όροι: Coloring of graphs and hypergraphs, Graph algorithms (graph-theoretic aspects), edge-coloring, \(f\)-coloring, sequential and parallel algorithms, 0102 computer and information sciences, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1288296
https://doi.org/10.7155/jgaa.00012
http://www.cs.brown.edu/publications/jgaa/accepted/99/ZhouNishizeki99.3.1.pdf
https://jgaa.info/getPaper?id=12
https://doi.org/10.7155/jgaa.00012
https://core.ac.uk/display/21258666
https://dblp.uni-trier.de/db/journals/jgaa/jgaa3.html#ZhouN99

Numerical procedures for a boundary value problem with a non-linear boundary condition

Συγγραφείς: Mehdi Dehghan

Πηγή: Applied Mathematics and Computation. 147:291-306

Θεματικοί όροι: Method of lines for initial value and initial-boundary value problems involving PDEs, Finite difference and finite volume methods for ordinary differential equations, Sequential and parallel algorithms, Nonlinear initial, boundary and initial-boundary value problems for linear parabolic equations, Rational approximant, Matrix exponential function, method of lines, Parallel numerical computation, 01 natural sciences, finite difference schemes, Parabolic partial differential equations, Neumann's boundary conditions, semi-discretization, 0101 mathematics, Specification of mass, numerical experiments, Stability, Non-classic boundary value problems

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://www.sciencedirect.com/science/article/pii/S0096300302006689

Parallel techniques for a boundary value problem with non-classic boundary conditions

Συγγραφείς: Mehdi Dehghan

Πηγή: Applied Mathematics and Computation. 137:399-412

Θεματικοί όροι: Method of lines for initial value and initial-boundary value problems involving PDEs, Sequential and parallel algorithms, finite difference, Heat equation, Parabolic partial differential, method of lines, Parallel numerical computation, algorithms, 01 natural sciences, Pade approximant, Central processor times, equations, Finite difference methods for initial value and initial-boundary value problems involving PDEs, Neumann's boundary conditions, matrix exponential function, 0101 mathematics, numerical experiments, Stability, initial-boundary value problem, Non-classic boundary value problems

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1977968
https://doi.org/10.1016/s0096-3003(02)00140-6
https://www.sciencedirect.com/science/article/pii/S0096300302001406
https://dblp.uni-trier.de/db/journals/amc/amc137.html#Dehghan03c
https://doi.org/10.1016/S0096-3003(02)00140-6
http://www.sciencedirect.com/science/article/pii/S0096300302001406

An efficient algorithm for constructing Hamiltonian paths in meshes

Συγγραφείς: Chen, Shao, Shen, Hong, Topor, Rodney William

Πηγή: Parallel Computing. 28:1293-1305

Θεματικοί όροι: Sequential and parallel algorithms, Meshes, Performance evaluation, 0202 electrical engineering, electronic engineering, information engineering, Distributed computing and systems software, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, efficient linear-time sequential algorithm, 01 natural sciences, Cognitive and computational psychology, Hamiltonian paths

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/pc/pc28.html#ChenST02
https://doi.org/10.1016/S0167-8191(02)00135-7
https://digital.library.adelaide.edu.au/dspace/handle/2440/36767
https://www.sciencedirect.com/science/article/abs/pii/S0167819102001357

Optimal computation of shortest paths on doubly convex bipartite graphs

Συγγραφείς: Lin Chen

Πηγή: Computers & Mathematics with Applications. 38:1-12

Θεματικοί όροι: Sequential and parallel algorithms, Extremal problems in graph theory, Optimality, doubly convex bipartite graphs, Shortest paths, optimal parallel algorithm, all-pair shortest paths, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences, Computational Mathematics, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, Modelling and Simulation, 0202 electrical engineering, electronic engineering, information engineering, Doubly convex bipartite graphs, Distributed algorithms, Paths and cycles, sequential algorithm

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://ieeexplore.ieee.org/document/652607/
https://www.computer.org/csdl/proceedings-article/icpads/1997/82270618/12OmNy87QsH
https://dblp.uni-trier.de/db/conf/icpads/icpads1997.html#Chen97a
https://www.sciencedirect.com/science/article/pii/S0898122199002011

Sequential and parallel local search for the time-constrained traveling salesman problem

Συγγραφείς: Martin W. P. Savelsbergh, Gerard A. P. Kindervater, Jan Karel Lenstra

Πηγή: Discrete Applied Mathematics. 42:211-225

Θεματικοί όροι: time windows, parallel computing, local search, Applied Mathematics, 0211 other engineering and technologies, sequential and parallel algorithms, Parallel numerical computation, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences, Traveling salesman problem, local optimality, traveling salesman, Discrete Mathematics and Combinatorics, time window

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/221654
https://doi.org/10.1016/0166-218x(93)90047-r
https://research.tue.nl/en/publications/a481399d-89c2-4f5c-a4f6-2a8692939703
https://doi.org/10.1016/0166-218X(93)90047-R
https://repub.eur.nl/pub/1501/
https://dblp.uni-trier.de/db/journals/dam/dam42.html#KindervaterLS93
https://www.narcis.nl/publication/RecordID/oai:repub.eur.nl:1501
https://pure.tue.nl/ws/files/2145875/340774.pdf
https://doi.org/10.1016/0166-218X(93)90047-R
https://www.sciencedirect.com/science/article/abs/pii/0166218X9390047R

An efficient parallel algorithm for the longest path problem in meshes

Συγγραφείς: Keshavarz-Kohjerdi, Fatemeh, Bagheri, Alireza

Πηγή: The Journal of Supercomputing: An International Journal of High-Performance Computer Design, Analysis, and Use. August 2013 65(2):723-741

A Survey on Data Mining Algorithms and Future Perspective

Συγγραφείς: N. K. Sharma, R. C. Jain, Manoj Yadav

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.ijcsit.com/docs/Volume%203/vol3issue5/ijcsit2012030542.pdf.

Θεματικοί όροι: Data mining, KDD, Clustering, Association Rule, Classification, Sequential and parallel Algorithms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.258.8919; http://www.ijcsit.com/docs/Volume%203/vol3issue5/ijcsit2012030542.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.258.8919
http://www.ijcsit.com/docs/Volume%203/vol3issue5/ijcsit2012030542.pdf

Numerical solution of a parabolic equation with non-local boundary specifications

Συγγραφείς: Dehghan, Mehdi

Πηγή: In Applied Mathematics and Computation 2003 145(1):185-194

Sequential and parallel complexity of approximate evaluation of polynomial zeros

Συγγραφείς: Victor Y. Pan

Πηγή: Computers & Mathematics with Applications. 14:591-622

Θεματικοί όροι: practical implementation, Analysis of algorithms and problem complexity, Software, source code, etc. for problems pertaining to functions of a complex variable, sequential and parallel algorithms, 0102 computer and information sciences, complex polynomial zeros, 01 natural sciences, upper bounds, Computational Mathematics, Computational Theory and Mathematics, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), Modelling and Simulation, Numerical computation of solutions to single equations, 0101 mathematics, arithmetic and Boolean complexity

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/4032925
https://doi.org/10.1016/0898-1221(87)90186-6
https://www.sciencedirect.com/science/article/pii/0898122187901866
https://core.ac.uk/display/22969160
http://comet.lehman.cuny.edu/vpan/pdf/pan61.pdf

Trial Division : Improvements and Implementations

Trial Division : Förbättringar och Implementationer

Συγγραφείς: Hedenström, Felix

Θεματικοί όροι: Trial Division Prime factorization Parallel sequential algorithm parallel algorithms, Computer Engineering, Datorteknik

Περιγραφή αρχείου: application/pdf

Διαθεσιμότητα: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211090

Trial Division : Improvements and Implementations ; Trial Division : Förbättringar och Implementationer

Συγγραφείς: Hedenström, Felix

Θεματικοί όροι: Trial Division Prime factorization Parallel sequential algorithm parallel algorithms, Computer Engineering, Datorteknik

Περιγραφή αρχείου: application/pdf

Διαθεσιμότητα: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211090

Constrained Global Optimization: Multiprocessor Approach

Συγγραφείς: Roman Strongin

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://si.deis.unical.it/~yaro/numta2013/abstracts/Strongin.pdf.

Θεματικοί όροι: straints, Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dor

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.692; http://si.deis.unical.it/~yaro/numta2013/abstracts/Strongin.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.692
http://si.deis.unical.it/~yaro/numta2013/abstracts/Strongin.pdf

Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods

Συγγραφείς: Özaktaş, Hakan

Συνεισφορές: Akgül, Mustafa

Θεματικοί όροι: Linear feasibility, regularization of ill conditioned problems, tomography, image reconstruction from projections, image restoration, image recovery, descent directions, analytic centers, central cutting (localization) methods, subgradient methods, sequential and parallel algorithms, long-step methods, constraints and block projections, surrogate, Cimmino’s method, the relaxation (successive orthogonal projections) method, projection methods, convex feasibility, T57.74 .O93 1998, Linear programming, Convex programming, Relaxation methods (Mathematics)

Περιγραφή αρχείου: xi, 94 leaves; application/pdf

Relation: http://hdl.handle.net/11693/18555

Διαθεσιμότητα: http://hdl.handle.net/11693/18555

A direct method and parallel algorithm for general N-dimensional FFT

Συγγραφείς: You, Zhaoyong, Li, Lei

Θεματικοί όροι: Complexity and performance of numerical algorithms, transform matrix, sequential and parallel algorithms, complexity, orthogonal transformation, fast Fourier transform, Numerical methods for discrete and fast Fourier transforms

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/123335