ParkView: Visualizing Monotone Interleavings

Συγγραφείς: Beurskens, Thijs, Van Den Broek, Steven, Simons, Arjen, Sonke, Willem, Verbeek, Kevin, Ophelders, Tim, Hoffmann, Michael, Speckmann, Bettina

Πηγή: 2025 IEEE 18th Pacific Visualization Conference (PacificVis) PACIFICVIS Pacific Visualization Conference (PacificVis), 2025 IEEE 18th. :118-127 Apr, 2025

Relation: 2025 IEEE 18th Pacific Visualization Conference (PacificVis)

Accelerating Transfer Function Update for Distance Map based Volume Rendering

Συγγραφείς: Rauter, Michael, Zimmermann, Lukas, Zeilinger, Markus

Πηγή: 2024 IEEE Visualization and Visual Analytics (VIS) VIS Visualization and Visual Analytics (VIS), 2024 IEEE. :171-175 Oct, 2024

Relation: 2024 IEEE Visualization and Visual Analytics (VIS)

Methodology of Algorithm Engineering

Συγγραφείς: Mendling, Jan, Leopold, Henrik, Meyerhenke, Henning, Depaire, Benoît

Πηγή: ACM Computing Surveys. 58(4):1-38

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3769071

Recognition Complexity of Subgraphs of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {k}}$$\end{document}-Connected Planar Cubic Graphs

Συγγραφείς: Goetze, Miriam^{Aff1, IDs00453025013508_cor1}, Jungeblut, Paul, Ueckerdt, Torsten

Πηγή: Algorithmica. 88(1)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees: Strategy Iteration with Universal Trees

Συγγραφείς: Koh, Zhuan Khye, Loho, Georg

Συνεισφορές: Zhuan Khye Koh and Georg Loho, Szeider, Stefan, Ganian, Robert, Silva, Alexandra

Πηγή: Logical Methods in Computer Science. 21

Θεματικοί όροι: universal trees, FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), value iteration, Discrete Mathematics, Logic in Computer Science, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Discrete mathematics, 0102 computer and information sciences, Theory of computation → Logic and verification, 01 natural sciences, Logic in Computer Science (cs.LO), parity games, strategy iteration, progress measure, Data Structures and Algorithms (cs.DS), ddc:004

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2108.13338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.63
http://eprints.lse.ac.uk/116860/

Formal Methods

Συνεισφορές: Platzer, Andre, Rozier, Kristin Yvonne, Pradella, Matteo, Rossi, Matteo

Θεματικοί όροι: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, Software Engineering, Mathematical theory of computation, Expert systems / knowledge-based systems, Programming and scripting languages: general, Computer hardware, Natural language and machine translation

Περιγραφή αρχείου: image/png; image/jpeg

Relation: Lecture Notes in Computer Science

Σύνδεσμος πρόσβασης: https://directory.doabooks.org/handle/20.500.12854/144770
https://library.oapen.org/handle/20.500.12657/93255
https://library.oapen.org/bitstream/20.500.12657/93255/1/978-3-031-71177-0.pdf

Dynamic Convex Hulls for Simple Paths

Συγγραφείς: Brewer, Bruce, Brodal, Gerth Stølting, Wang, Haitao^{Aff1, IDs00454024007150_cor1}

Πηγή: Discrete & Computational Geometry. :1-36

Additive Sparsification of CSPs

Συγγραφείς: Eden Pelleg, Stanislav Živný

Συνεισφορές: Eden Pelleg and Stanislav Živný, Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

Πηγή: European Symposium on Algorithms

Θεματικοί όροι: graphs, FOS: Computer and information sciences, minimum cuts, Discrete Mathematics (cs.DM), Theory of computation → Design and analysis of algorithms, Theory of computation → Sparsification and spanners, additive sparsification, 0102 computer and information sciences, 01 natural sciences, hypergraphs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2106.14757
https://arxiv.org/abs/2106.14757
https://drops.dagstuhl.de/opus/volltexte/2021/14656/pdf/LIPIcs-ESA-2021-75.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-14757
https://ora.ox.ac.uk/objects/uuid:9d412617-8c82-44a4-80b6-2346f1cfdccd
https://arxiv.org/pdf/2106.14757
https://ora.ox.ac.uk/objects/uuid:9d412617-8c82-44a4-80b6-2346f1cfdccd
https://doi.org/10.4230/lipics.esa.2021.75
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.75

Algorithmic Contract Theory: A Survey: Algorithmic contract theory: a survey

Συγγραφείς: Dütting, Paul, Feldman, Michal, Talgam-Cohen, Inbal

Πηγή: Foundations and Trends® in Theoretical Computer Science

Θεματικοί όροι: FOS: Computer and information sciences, Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance, online learning, design and analysis of algorithms, algorithmic game theory, economics of information and the web, FOS: Economics and business, Computer Science - Computer Science and Game Theory, Economics - Theoretical Economics, Contract theory (moral hazard, adverse selection), Theoretical Economics (econ.TH), classification and prediction, game-theoretic learning, Algorithmic game theory and complexity, operations research, Computer Science and Game Theory (cs.GT)

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2412.16384
https://zbmath.org/7975758
https://doi.org/10.1561/0400000113

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Συγγραφείς: Gottesbüren, Lars, Maas, Nikolai, Rosch, Dominik, Sanders, Peter, Seemaier, Daniel

Πηγή: ISSN: 1868-8969.

Θεματικοί όροι: Graph Partitioning, Graph Algorithms, Linear Time Algorithms, Graph Sparsification, Theory of computation → Design and analysis of algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

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

Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000186957; https://publikationen.bibliothek.kit.edu/1000186957/169409927; https://doi.org/10.5445/IR/1000186957

Διαθεσιμότητα: https://publikationen.bibliothek.kit.edu/1000186957
https://publikationen.bibliothek.kit.edu/1000186957/169409927
https://doi.org/10.5445/IR/1000186957

A Subquadratic Algorithm for Computing the L1-distance between Two Terrains

Συγγραφείς: Agarwal, Pankaj, K., Aronov, Boris, Devillers, Olivier, Knauer, Christian, Moroz, Guillaume

Συνεισφορές: Duke University Durham, NYU Tandon School of Engineering, Geometric Algorithms and Models Beyond the Linear and Euclidean realm (GAMBLE), Centre Inria de l'Université de Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Institut für Informatik, Universität Bayreuth Deutschland = University of Bayreuth Germany = Université de Bayreuth Allemagne, ANR-24-CE48-1899,StratMesh,Triangulation d'espaces stratifiés(2024)

Πηγή: Leibniz International Proceedings in Informatics (LIPIcs) ; Symposium on Computational Geometry (SoCG) ; https://hal.science/hal-04908634 ; Symposium on Computational Geometry (SoCG), Jun 2025, Kanazawa, Japan. pp.4:1-4:17, ⟨10.4230/LIPIcs.SoCG.2025.4⟩

Θεματικοί όροι: polynomial interpolation, Theory of computation → Design and analysis of algorithms, Theory of computation → Computational geometry, bivariate multipoint evaluation, geometric cuttings, volume computation, Terrain similarity, Terrains, Computational geometry, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

Θέμα γεωγραφικό: Kanazawa, Japan

Διαθεσιμότητα: https://hal.science/hal-04908634
https://hal.science/hal-04908634v1/document
https://hal.science/hal-04908634v1/file/socg-abs.pdf
https://doi.org/10.4230/LIPIcs.SoCG.2025.4

Repetitive Processes and Their Surrogate-Model Congruent Encoding for Evolutionary Algorithms - A Theoretic Proposal

Συγγραφείς: Christina Plump, Bernhard Berger, Rolf Drechsler

Πηγή: Proceedings of the Companion Conference on Genetic and Evolutionary Computation. :2289-2296

Θεματικοί όροι: algorithms for application, evolutionary algorithm, design and analysis of algorithms, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, surrogate model, theory

FAST-MEPSA: An optimised and faster version of peak detection algorithm MEPSA

Συγγραφείς: Maistrello, M. ^{a, b, ⁎}, Maccary, R. ^{a, b}, Guidorzi, C. ^{a, b, c}

Πηγή: In Astronomy and Computing December 2025

Force-Directed Graph Layouts by Edge Sampling

Συγγραφείς: Gove, Robert

Πηγή: 2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV) Large Data Analysis and Visualization (LDAV),2019 IEEE 9th Symposium on. :1-5 Oct, 2019

Relation: 2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)

Exact and Approximate Drone Warehouse for a Mixed Landscape Delivery System

Συγγραφείς: Bartoli, Luca, Betti Sorbelli, Francesco, Coro, Federico, Pinotti, Cristina M., Shende, Anil

Πηγή: 2019 IEEE International Conference on Smart Computing (SMARTCOMP) SMARTCOMP Smart Computing (SMARTCOMP), 2019 IEEE International Conference on. :266-273 Jun, 2019

Relation: 2019 IEEE International Conference on Smart Computing (SMARTCOMP)

Reconstruction of Depth-4 Multilinear Circuits

Συγγραφείς: Bhargava, Vishwas, Saraf, Shubhangi, Volkovich, Ilya

Πηγή: ACM Transactions on Computation Theory, (2025-03-28)

Θεματικοί όροι: Arithmetic Circuits, Reconstruction, Learning, Bounded-depth Circuits, Theory of computation, Algebraic complexity theory, Design and analysis of algorithms

Relation: https://authors.library.caltech.edu/communities/caltechauthors/; https://doi.org/10.1145/3726532

Διαθεσιμότητα: https://doi.org/10.1145/3726532

On efficient algorithms for bottleneck path problems with many sources

Συγγραφείς: Kaymakov, Kirill V., Malyshev, Dmitry S.^{Aff2, IDs11590024021130_cor2}

Πηγή: Optimization Letters. :1-11

Formal Methods

Συνεισφορές: Platzer, Andre, Rozier, Kristin Yvonne, Pradella, Matteo, Rossi, Matteo

Θεματικοί όροι: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, Software Engineering, Mathematical theory of computation, Expert systems / knowledge-based systems, Programming and scripting languages: general, Computer hardware, Natural language and machine translation

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

Relation: Lecture Notes in Computer Science

Σύνδεσμος πρόσβασης: https://library.oapen.org/handle/20.500.12657/93255

Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing

Συγγραφείς: Wenkai Dai, Klaus-Tycho Foerster, David Fuchssteiner, Stefan Schmid

Πηγή: ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 8:1-30

Θεματικοί όροι: design and analysis of algorithms, network design, load optimization, optical networks, 0102 computer and information sciences, 02 engineering and technology, algorithms, network architectures, 01 natural sciences, networks, 0202 electrical engineering, electronic engineering, information engineering, complexity, theory of computation

Efficient Exact Online String Matching Through Linked Weak Factors

Συγγραφείς: Matthew N. Palmer, Simone Faro, Stefano Scafiti

Συνεισφορές: Matthew N. Palmer and Simone Faro and Stefano Scafiti

Θεματικοί όροι: String matching, text processing, weak recognition, hashing, experimental algorithms, design and analysis of algorithms, design and analysis of algorithms, experimental algorithms, String matching, text processing, ddc:004, weak recognition, hashing

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

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.24
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.24
https://hdl.handle.net/20.500.11769/641810
https://doi.org/10.4230/lipics.sea.2024.24