Suchergebnisse - (( graph algorithms in informatics ) OR ( graph algorithms in informatika ))

Graph-based semi-supervised learning with genomic data integration using condition-responsive genes applied to phenotype classification

Autoren: Torshizi, Abolfazl Doostparast Petzold, Linda R

Quelle: Journal of the American Medical Informatics Association. 25(1)

Schlagwörter: Human Genome, Genetics, Networking and Information Technology R&D (NITRD), Biotechnology, Rare Diseases, Algorithms, Computational Biology, DNA Methylation, Female, Gene Expression, Genomics, Humans, Metabolic Networks and Pathways, Ovarian Neoplasms, Phenotype, Supervised Machine Learning, gene expression, DNA methylation, semi-supervised learning, graph theory, ovarian cancer, data integration, Information and Computing Sciences, Engineering, Medical and Health Sciences, Medical Informatics

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/0rx7d9qm
https://escholarship.org/content/qt0rx7d9qm/qt0rx7d9qm.pdf

Algorithms for string and graph data protection

Autoren: Chen, Huiping Loukidis, Grigorios

Weitere Verfasser: Chen, Huiping Loukidis, Grigorios

Zugangs-URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.872901

Embedding electronic health records onto a knowledge network recognizes prodromal features of multiple sclerosis and predicts diagnosis

Autoren: Nelson, Charlotte A Bove, Riley Butte, Atul J et al.

Quelle: Journal of the American Medical Informatics Association. 29(3)

Schlagwörter: Brain Disorders, Clinical Research, Neurodegenerative, Patient Safety, Neurosciences, Multiple Sclerosis, Networking and Information Technology R&D (NITRD), 8.4 Research design and methodologies (health services), Health and social care services research, Generic health relevance, Neurological, Good Health and Well Being, Algorithms, Electronic Health Records, Humans, Machine Learning, Precision Medicine, knowledge graph, electronic health records, multiple sclerosis, preventative medicine, Information and Computing Sciences, Engineering, Medical and Health Sciences, Medical Informatics

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/47m9r8qv
https://escholarship.org/content/qt47m9r8qv/qt47m9r8qv.pdf

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing

Autoren: Eppstein, D Goodrich, MT Liu, S

Quelle: Leibniz International Proceedings in Informatics Lipics. 351

Schlagwörter: 46 Information and computing sciences (for-2020)

Zugangs-URL: https://escholarship.org/uc/item/35q5x6tf

Parallel Algorithms for Medical Informatics on Data-Parallel Many-Core Processors

Autoren: Moazeni, Maryam

Schlagwörter: Computer science, Computer engineering, GPGPU, Graphics Processors, Many-Core Processors, Medical Informatics, Parallel Algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/4pf726r4
https://escholarship.org/content/qt4pf726r4/qt4pf726r4.pdf

Bipartitní graf

Autoren: Töpfer, Pavel

Quelle: Matematika-fyzika-informatika [online] 31(1), 58-65. (2022)

Schlagwörter: graph algorithms, time complexity, bipartite graph, olympiad in informatics, grafové algoritmy, bipartitní graf, časová složitost, matematická olympiáda - kategorie P

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/20.500.14178/2215

Markov chains for sampling matchings

Autoren: Matthews, James Cryan, Mary. Jerrum, Mark

Weitere Verfasser: Matthews, James Cryan, Mary. Jerrum, Mark

Schlagwörter: 004, Informatics, Computer Science, Markov Chain Monte Carlo algorithm, Markov chain

Zugangs-URL: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.562225

Generation of shortest path search dataflow networks of actors for parallel multi-core implementation ; Генерация потоковых сетей акторов поиска кратчайших путей для параллельной многоядерной реализации

Autoren: A. A. Prihozhy А. А. Прихожий

Quelle: Informatics; Том 20, № 2 (2023); 65-84 ; Информатика; Том 20, № 2 (2023); 65-84 ; 2617-6963 ; 1816-0301

Schlagwörter: ускорение, network of actors, CAL language, shortest paths, blocked algorithm, multi-core system, speedup, сеть акторов, язык CAL, кратчайшие пути, блочный алгоритм, многоядерная система

Dateibeschreibung: application/pdf

Relation: https://inf.grid.by/jour/article/view/1245/1053; Floyd R. W. Algorithm 97: Shortest path. Communications of the ACM, 1962, vol. 5, no. 6, p. 345.; Madkour A, Aref W. G., Rehman F. U., Rahman M. A., Basalamah S. A. Survey of Shortest-Path Algorithms, 2017, 26 р. Available at: https://arxiv.org/abs/1705.02044 (accessed 23.11.2022).; Anu P., Kumar M. G. Finding all-pairs shortest path for a large-scale transportation network using parallel Floyd-Warshall and parallel Dijkstra algorithms. Journal of Computing in Civil Engineering, 2013, vol. 27, no. 3, pp. 263–273.; Prihozhy A. A., Mattavelli M., Mlynek D. Evaluation of parallelization potential for efficient multimedia implementations: dynamic evaluation of algorithm critical path. IEEE Transactions on Circuits and Systems for Video Technology, vol. 15, no. 5, 2005, pp. 593–608.; Singh A., Mishra P. K. Performance analysis of Floyd Warshall algorithm vs rectangular algorithm. International Journal of Computer Applications, 2014, vol. 107, no. 16, pp. 23–27.; Venkataraman G. A., Sahni S., Mukhopadhyaya S. Blocked all-pairs shortest paths algorithm. Journal of Experimental Algorithmics (JEA), 2003, vol. 8, pp. 857–874.; Park J., Penner M., Prasanna V. K. Optimizing graph algorithms for improved cache performance. IEEE Transactions on Parallel and Distributed Systems, 2004, vol. 15, no. 9, pp. 769–782.; Madduri K., Bader D. A., Berry J. W., Crobak J. R. An experimental study of a parallel shortest path algorithm for solving large-scale graph instances. Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, 6 January 2007. New Orleans, 2007, pp. 23–35.; Albalwi E., Thulasiraman P., Thulasiram R. Task level parallelization of all pair shortest path algorithm in OpenMP 3.0. Advances in Computer Science and Engineering (CSE 2013). Los Angeles, Atlantis Press, 2013, pp. 109–112.; Tang P. Rapid development of parallel blocked all-pairs shortest paths code for multi-core computers. IEEE SOUTHEASTCON 2014, Lexington, KY, USA, 13–16 March 2014. Lexington, 2014, pp. 1–7.; Prihozhy A. A., Karasik O. N. Heterogeneous blocked all-pairs shortest paths algorithm. Sistemnyj analiz i prikladnaja informatika [System Analysis and Applied Information Science], 2017, no. 3, pp. 68–75 (In Russ.). https://doi.org/10.21122/2309-4923-2017-3-68-75; Karasik O. N., Prihozhy A. A. Threaded block-parallel algorithm for finding the shortest paths on graph. Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki [Reports of the Belarusian State University of Informatics and Radioelectronics], 2018, no. 2, pp. 77–84 (In Russ.).; Karasik O. N., Prihozhy A. A. Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation. System Analysis and Applied Information Science, 2022, no. 3, pp. 68–75. https://doi.org/10.21122/2309-4923-2022-3-57-65; Prihozhy A. A. Simulation of direct mapped, k-way and fully associative cache on all pairs shortest paths algorithms. System Analysis and Applied Information Science, 2019, no. 4, pp. 10–18. https://doi.org/10.21122/2309-4923-2019-4-10-18; Prihozhy A. A. Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms. System Analysis and Applied Information Science, 2021, no. 3, pp. 40–50. https://doi.org/10.21122/2309-4923-2021-3-40-50; Likhoded N. A., Sipeyko D. S. Generalized blocked Floyd – Warshall algorithm. Journal of the Belarusian State University. Mathematics and Informatics, 2019, no. 3, pp. 84– 92 (In Russ).; Kahn G. The semantics of a simple language for parallel programming. Information Processing 74: Proceedings of the IFIP Congress 74, Stockholm, Sweden, 5–10 August 1974. Stockholm, 1974, pp. 471–475.; Lee E. A., Messerschmitt D. G. Synchronous dataflow. Proceedings of the IEEE, September 1987, vol. 75, no. 9, pp. 1235–1245.; Prihozhy A., Mlynek D., Solomennik M., Mattavelli M. Techniques for optimization of net algorithms. 2002 International Conference on Parallel Computing in Electrical Engineering (PARELEC 2002), Warsaw, Poland, 22–25 September 2002. Warsaw, 2002, pp. 211–216.; Eker J., Janneck J. W. Cal Language Report : Technical Report UCB/ERL M03/48. University of California at Berkeley, December 2003, 107 p.; Bhattacharyya S. S., Brebner G., Janneck J. W., Eker J., Platen C., …, Raulet M. OpenDF – a dataflow toolset for reconfigurable hardware and multicore systems. First Swedish Workshop on Multi-Core Computing, MCC, Ronneby, Sweden, 27–28 November 2008. Ronneby, 2008, рр. 43–49.; Murthy P. K., Lee E. A. Multidimensional synchronous dataflow. IEEE Transactions on Signal Processing, 2002, vol. 50, no. 8, pp. 2064–2079.; Bhattacharya B., Bhattacharyya S. S. Parameterized dataflow modeling for DSP systems. IEEE Transactions on Signal Processing, 2001, vol. 49, no. 10, pp. 2408–2421.; Bebelis V., Fradet P., Girault A., Lavigueur B. BPDF: Boolean Parametric Data Flow : Research Report RR-8333. INRIA, 2013, 21 p.; Rahman A.-H. Ab, Prihozhy A., Mattavelli M. Pipeline synthesis and optimization of FPGA-based video processing applications with CAL. EURASIP Journal on Image and Video Processing, vol. 2011:19, pp. 1–28. https://doi.org/10.1186/16875281-2011-19; Prihozhy A., Casale-Brunet S., Bezati E., Mattavelli M. Efficient dynamic optimization heuristics for dataflow pipelines. 2018 IEEE International Workshop on Signal Processing Systems, SiPS 2018, Cape Town, South Africa, 21–24 October 2018. Cape Town, 2018, pp. 337–342.; Prihozhy A. A., Casale-Brunet S., Bezati E., Mattavelli M. Pipeline synthesis and optimization from branched feedback dataflow programs. Journal of Signal Processing Systems, Springer Nature, 2020, vol. 92, pp. 1091–1099. https://doi.org/10.1007/s11265-020-01568-5; https://inf.grid.by/jour/article/view/1245

Verfügbarkeit: https://inf.grid.by/jour/article/view/1245
https://doi.org/10.37661/1816-0301-2023-20-2-65-84

Lossless Pangenome Indexing Using Tag Arrays

Autoren: Eskandar, P Paten, B Sirén, J

Quelle: Leibniz International Proceedings in Informatics Lipics. 344

Schlagwörter: 46 Information and computing sciences (for-2020)

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/09j4x7gz
https://escholarship.org/content/qt09j4x7gz/qt09j4x7gz.pdf

ALGORITHMS FOR CONSTRUCTION, CLASSIFICATION AND ENUMERATION OF CLOSED KNIGHT’S PATHS

Autoren: Kapralov, Stoyan Bakoev, Valentin Kapralov, Kaloyan

Quelle: Mathematics and Informatics ; volume 66, issue 2, page 107-114 ; ISSN 1310-2230 1314-8532

Verfügbarkeit: https://doi.org/10.53656/math2023-2-1-alg

Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms

Autoren: Sawitzki, Daniel

Quelle: Lecture Notes in Computer Science ; LATIN 2006: Theoretical Informatics ; page 781-792 ; ISSN 0302-9743 1611-3349 ; ISBN 9783540327554 9783540327561

Verfügbarkeit: http://dx.doi.org/10.1007/11682462_71
http://link.springer.com/content/pdf/10.1007/11682462_71

Application of the K-Means Method for Clustering Capture Fisheries Products in North Aceh with A Data Mining Approach.

Autoren: Nurdin Bustami Meiyanti, Rini et al.

Quelle: Journal of Advanced Zoology. 2023, Vol. 44 Issue 4, p39-49. 11p.

Anomaly Detection in Electronic Health Records Across Hospital Networks: Integrating Machine Learning With Graph Algorithms

Autoren: Haoran Niu Olufemi A. Omitaomu Michael A. Langston et al.

Quelle: IEEE Journal of Biomedical and Health Informatics. 29:3723-3735

Schlagwörter: Machine Learning, Electronic Health Records, Humans, Algorithms, Hospitals, Medical Informatics

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/40030967

Link prediction in large directed graphs

Autoren: Garcia Gasulla, Dario

Weitere Verfasser: University/Department: Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, University/Department: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació

Thesis Advisors: Cortés, Ulises, 1960-

Quelle: TDX (Tesis Doctorals en Xarxa)

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/10803/299070
https://dx.doi.org/10.5821/dissertation-2117-95691

Spectral techniques in graph algorithms ; Invited paper

Autoren: Alon, Noga

Quelle: Lecture Notes in Computer Science ; LATIN'98: Theoretical Informatics ; page 206-215 ; ISSN 0302-9743 1611-3349 ; ISBN 9783540642756 9783540697152

Verfügbarkeit: https://doi.org/10.1007/bfb0054322
https://link.springer.com/content/pdf/10.1007/BFb0054322

Negative-Weight Single-Source Shortest Paths in Near-linear Time.

Autoren: Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian

Quelle: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-34, 34p

Schlagwörter: GRAPH algorithms, ALGORITHMS, GRAPH theory, COMPUTATIONAL complexity

Swarm intelligence techniques for optimization and management tasks insensor networks

Autoren: Hernández Pibernat, Hugo

Weitere Verfasser: University/Department: Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics

Thesis Advisors: Blum, Christian

Quelle: TDX (Tesis Doctorals en Xarxa)

Schlagwörter: Optimization, Swarm intelligence, Wireless sensor networks, Distributed algorithms, Energy saving

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/10803/81861
https://dx.doi.org/10.5821/dissertation-2117-94607

二部分構造を持つ順序付け問題に対する近似方式

Autoren: アレクサンダル シュルベフスキ 永持, 仁 太田, 快人 et al.

Weitere Verfasser: アレクサンダル シュルベフスキ 永持, 仁 太田, 快人 et al.

Schlagwörter: Combinatorial Optimization, Sequencing Problems, Routing Problems, Approximation Algorithms, Approximation Framework, Bipartite Graphs, Traveling Salesman

Dateibeschreibung: application/pdf

Zugangs-URL: https://ndlsearch.ndl.go.jp/books/R100000039-I8952808

Degree: 博士(情報学) -- 京都大学, Kyoto University

Query-based Graph Data Reduction

Autoren: Wang, Shao-Ting

Schlagwörter: Computer science, Data Compression, Data Reduction, Graph, Query-based, Semantic

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/8mn4v83p
https://escholarship.org/content/qt8mn4v83p/qt8mn4v83p.pdf

Deep neural networks for pose validation, affinity prediction, and input attribution

Autoren: Scantlebury, Jack Deane, Charlotte Von Delft, Frank

Weitere Verfasser: Scantlebury, Jack Deane, Charlotte Von Delft, Frank

Schlagwörter: Molecular biology, Neural networks (Computer science)

Zugangs-URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.886980