Search Results - "Algorithms in computer science"

FastVPINNs: Tensor-Driven Acceleration of VPINNs for Complex Geometries: FastVPINNs: tensor-driven acceleration of VPINNs for complex geometries

Authors: Thivin Anandh Divij Ghose Himanshu Jain et al.

Source: SIAM Journal on Scientific Computing. 47:C578-C600

Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Neural and Evolutionary Computing, Numerical Analysis (math.NA), Computer aspects of numerical algorithms, General topics in artificial intelligence, Machine Learning (cs.LG), physics-informed neural networks, Computational Engineering, Finance, and Science (cs.CE), domain decomposition, FOS: Mathematics, Mathematics - Numerical Analysis, Neural and Evolutionary Computing (cs.NE), Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems, Computer Science - Computational Engineering, Finance, and Science, Algorithms in computer science, hp-variational physics-informed neural networks, variational physics-informed neural networks

File Description: application/xml

Access URL: http://arxiv.org/abs/2404.12063

On Newton's identities in positive characteristic

Authors: Sjoerd de Vries

Source: Journal of Algebra. 668:348-364

Subject Terms: Symmetric functions and generalizations, symmetric polynomials, Symmetric polynomials, Newton's identities, Algebra and Logic, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Representation Theory (math.RT), Algorithms in computer science, Enumerative combinatorics, 05E05 (Primary) 11T06 (Secondary), Mathematics - Representation Theory, Algebra och logik

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2305.19850
https://zbmath.org/8015279
https://doi.org/10.1016/j.jalgebra.2025.01.010
http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-239583

Characterization of Isometric Words based on Swap and Mismatch Distance: Characterization of isometric words based on swap and mismatch distance

Authors: Marcella Anselmo Giuseppa Castiglione Manuela Flores et al.

Source: International Journal of Foundations of Computer Science. 36:221-245

Subject Terms: Graph theory, FOS: Computer and information sciences, Discrete mathematics in relation to computer science, overlap with errors, Swap and mismatch distance, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, isometric words, Algorithms in computer science, swap and mismatch distance

File Description: application/xml

Access URL: http://arxiv.org/abs/2404.13577
https://hdl.handle.net/20.500.11769/644232

A Domain Decomposition Solver for Large Scale Time-Harmonic Flow Acoustics Problems: A domain decomposition solver for large scale time-harmonic flow acoustics problems

Authors: P. Marchner H. Bériot S. Le Bras et al.

Contributors: P. Marchner H. Bériot S. Le Bras et al.

Source: SIAM Journal on Scientific Computing. 47:B333-B359

Subject Terms: Sciences informatiques, Multigrid methods, domain decomposition for boundary value problems involving PDEs, Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation, Physique, chimie, mathématiques & sciences de la terre, pierce operator, high frequency problems, Acoustic problems, Time-harmonic, [INFO] Computer Science [cs], absorbing boundary conditions, Flow acoustics, Ingénierie, informatique & technologie, Physical, chemical, mathematical & earth Sciences, Optimized Schwarz methods, Performance computing, Pierce operator, [MATH.MATH-AP] Mathematics [math]/Analysis of PDEs [math.AP], High-performance computing, Domain decompositions, Absorbing boundary conditions, [SPI.ACOU] Engineering Sciences [physics]/Acoustics [physics.class-ph], Applied Mathematics, high-performance computing, [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], Computer science, Engineering, computing & technology, Computational Mathematics, Mathématiques, domain decomposition, Absorbing boundary condition, High frequency problems, optimized Schwarz method, Parallel algorithms in computer science, Mathematics

File Description: application/xml; application/pdf

Access URL: https://hdl.handle.net/2268/332678
https://doi.org/10.1137/23M1607040

Jet: Multilevel Graph Partitioning on Graphics Processing Units: Jet: multilevel graph partitioning on graphics processing units

Authors: Michael S. Gilbert Kamesh Madduri Erik G. Boman et al.

Source: SIAM Journal on Scientific Computing. 46:B700-B724

Subject Terms: FOS: Computer and information sciences, graph partitioning, GPUs, Computer Science - Distributed, Parallel, and Cluster Computing, Discrete Mathematics (cs.DM), Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), refinement, Distributed, Parallel, and Cluster Computing (cs.DC), Parallel algorithms in computer science, Computer Science - Discrete Mathematics

File Description: application/xml

Access URL: http://arxiv.org/abs/2304.13194

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs: Conflict-free coloring: graphs of bounded clique-width and intersection graphs

Authors: Bhyravarapu, Sriram Hartmann, Tim A. Hoang, Hung P. et al.

Source: Algorithmica. 86:2250-2288

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, conflict-free coloring, intersection graphs, 01 natural sciences, Graph theory, graph coloring, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Algorithms in computer science, clique-width, Computer Science - Discrete Mathematics

File Description: application/xml; PDF

Access URL: http://arxiv.org/abs/2105.08693

Recognizing Map Graphs of Bounded Treewidth: Recognizing map graphs of bounded treewidth

Authors: Angelini P. Bekos M. A. Da Lozzo G. et al.

Contributors: Angelini P. Bekos M. A. Da Lozzo G. et al.

Source: Algorithmica. 86:613-637

Subject Terms: FOS: Computer and information sciences, map graphs, Map graphs, K-map graphs, Fixed-parameter tractability, Treewidth, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph theory, Recognition, Parameterized complexity, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, treewidth, Data Structures and Algorithms (cs.DS), ddc:004, Algorithms in computer science

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2206.14898
https://zbmath.org/7795037
https://doi.org/10.1007/s00453-023-01180-6
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.8
https://hdl.handle.net/11590/469307
https://doi.org/10.1007/s00453-023-01180-6
https://hdl.handle.net/11391/1568273
https://link.springer.com/article/10.1007/s00453-023-01180-6
https://doi.org/10.1007/s00453-023-01180-6
https://hdl.handle.net/11391/1532673
https://doi.org/10.4230/LIPIcs.SWAT.2022.8

Analyticity for Locally Stable Hard-Core Gases via Recursion: Analyticity for locally stable hard-core gases via recursion

Authors: Qidong He

Source: Journal of Statistical Physics. 192

Subject Terms: Statistical Mechanics (cond-mat.stat-mech), hard-core models, Probability (math.PR), FOS: Physical sciences, Applications of statistical mechanics to specific types of physical systems, Mathematical Physics (math-ph), Gibbs point processes, absence of phase transitions, Statistical Mechanics, Equilibrium statistical mechanics, FOS: Mathematics, Algorithms in computer science, locally stable interactions, Mathematical Physics, Probability

File Description: application/xml

Access URL: http://arxiv.org/abs/2405.04451
https://zbmath.org/8035330
https://doi.org/10.1007/s10955-025-03435-8

Regular Languages in the Sliding Window Model: Regular languages in the sliding window model

Authors: Moses Ganardi Danny Hucke Markus Lohrey et al.

Source: TheoretiCS. 4

Subject Terms: FOS: Computer and information sciences, streaming algorithms, Formal Languages and Automata Theory (cs.FL), Theory of computing, Theory of data, Computer Science - Formal Languages and Automata Theory, Algorithms in computer science, regular languages, sliding window model

File Description: application/xml

Access URL: http://arxiv.org/abs/2402.13385

Relaxed Two-Step Inertial Tseng’s Extragradient Method for Nonmonotone Variational Inequalities: Relaxed two-step inertial Tseng's extragradient method for nonmonotone variational inequalities

Authors: Duong Viet Thong Pham Ky Anh Vu Tien Dung

Source: Journal of Optimization Theory and Applications. 205

Subject Terms: nonmonotone mapping, Fixed-point theorems, Iterative procedures involving nonlinear operators, Variational and other types of inequalities involving nonlinear operators (general), two step inertial technique, Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc, weak convergence, Parallel numerical computation, Parallel algorithms in computer science, Tseng's extragradient method, variational inequality, Numerical methods for variational inequalities and related problems

File Description: application/xml

An efficient algorithm with double inertial steps for solving split common fixed point problems and an application to signal processing

Authors: Duong Viet Thong Simeon Reich Xiao-Huan Li et al.

Source: Computational and Applied Mathematics. 44

Subject Terms: Fixed-point theorems, split common fixed point problem, demicontractive operator, Parallel numerical computation, Parallel algorithms in computer science, signal processing, Monotone operators and generalizations, self-adaptive algorithm, Numerical methods for variational inequalities and related problems, double inertial steps

File Description: application/xml

Reconfiguration of stability and control strategy for some unmanned deformable vehicles

Authors: Jun Liu Jiandang Xing Changwu Liu et al.

Source: Applied Mathematical Modelling. 127:784-802

Subject Terms: variable-universe fuzzy control, simulated annealing optimization, Mathematical programming, unmanned deformable vehicle, reconfiguration motion stability, Algorithms in computer science, Operations research, mathematical programming

File Description: application/xml

Access URL: https://zbmath.org/8022417
https://doi.org/10.1016/j.apm.2024.01.005

Parallel Near-Duplicate Document Detection Using General-Purpose GPU

Authors: Peshevski, Dimitar Zdraveski, Vladimir Ristov, Sashko

Source: COMPUTING AND INFORMATICS; Vol. 43 No. 3 (2024): Computing and Informatics; 583–610

Subject Terms: parallelism, Shingling, GPU, Near-duplicate, fingerprint, document, CUDA, 68W10, 02 engineering and technology, 0202 electrical engineering, electronic engineering, information engineering, MinHash, locality-sensitive hashing, Parallel algorithms in computer science, similarity

File Description: application/pdf

Access URL: https://www.cai.sk/ojs/index.php/cai/article/view/2024_3_583

Algebraic Restriction Codes and Their Applications: Algebraic restriction codes and their applications

Authors: Aggarwal, Divesh Döttling, Nico Dujmovic, Jesko et al.

Contributors: Aggarwal, Divesh Döttling, Nico Dujmovic, Jesko et al.

Source: Algorithmica. 85:3602-3648

Subject Terms: statistically sender private, ALGEBRAIC RESTRICTION CODES, OBLIVIOUS TRANSFER, RATE 1, STATISTICALLY SENDER PRIVATE, OT, DIFFIE-HELLMAN, DDH, Statistically Sender Private, Diffie-Hellman, 0102 computer and information sciences, 02 engineering and technology, Rate 1, OT, algebraic restriction codes, 01 natural sciences, Algebraic Restriction Codes, Graph theory, rate 1, 0202 electrical engineering, electronic engineering, information engineering, Oblivious Transfer, ddc:004, DDH, Algorithms in computer science, oblivious transfer

File Description: application/xml; application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.2

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions: Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions

Authors: Doerr, Carola Janett, Duri Andrea Lengler, Johannes

Contributors: Doerr, Carola Janett, Duri Andrea Lengler, Johannes

Source: Doerr, C, Janett, D A & Lengler, J 2024, ' Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions ', Algorithmica, vol. 86, no. 10, pp. 3115–3152 . https://doi.org/10.1007/s00453-024-01258-9

Subject Terms: FOS: Computer and information sciences, theory of evolutionary computation, Theory of Evolutionary Computation, mutation operators, Computer Science - Neural and Evolutionary Computing, Mutation operators, 02 engineering and technology, [INFO] Computer Science [cs], Graph theory, 0202 electrical engineering, electronic engineering, information engineering, Runtime analysis, Theory of evolutionary computation, Neural and Evolutionary Computing (cs.NE), Mutation Operators, Algorithms in computer science, runtime analysis

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2302.12338
https://zbmath.org/7931149
https://doi.org/10.1007/s00453-024-01258-9
https://curis.ku.dk/ws/files/411853419/Tight_Runtime_Bounds_for_Static_Unary_Unbiased.pdf
https://hal.sorbonne-universite.fr/hal-04759426v1
https://hal.sorbonne-universite.fr/hal-04759426v1/document
https://doi.org/10.1007/s00453-024-01258-9
https://hal.sorbonne-universite.fr/hal-04180577v1
https://doi.org/10.1145/3583131.3590482
https://hal.sorbonne-universite.fr/hal-04180577v1/document

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs: Computing dense and sparse subgraphs of weakly closed graphs

Authors: Tomohiro Koana Christian Komusiewicz Frank Sommer et al.

Contributors: Tomohiro Koana Christian Komusiewicz Frank Sommer et al.

Source: Algorithmica. 85:2156-2187

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik, dominating set, 0102 computer and information sciences, c-closure, 01 natural sciences, Graph theory, clique relaxations, bicliques, \(c\)-closure, Fixed-parameter tractability, fixed-parameter tractability, c-Closure, FOS: Mathematics, degeneracy, Mathematics - Combinatorics, Combinatorics (math.CO), ddc:004, Algorithms in computer science, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2007.05630
https://zbmath.org/7704072
https://doi.org/10.1007/s00453-022-01090-z
https://drops.dagstuhl.de/opus/volltexte/2020/13364/
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-05630
https://drops.dagstuhl.de/opus/volltexte/2020/13364/pdf/LIPIcs-ISAAC-2020-20.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.20

The Need for Seed (in the abstract Tile Assembly Model): The need for seed (in the abstract Tile Assembly Model)

Authors: Alseth, Andrew Patitz, Matthew J.

Source: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554

Subject Terms: tile complexity, 0301 basic medicine, Computational Geometry (cs.CG), FOS: Computer and information sciences, algorithmic self-assembly, Computer Science - Emerging Technologies, tile assembly model, 0102 computer and information sciences, simulation, 01 natural sciences, Graph theory, 03 medical and health sciences, Emerging Technologies (cs.ET), Computer Science - Computational Geometry, Algorithms in computer science

File Description: application/xml

Access URL: http://arxiv.org/abs/2211.03877

Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022: Minimum partition into plane subgraphs: the CG:SHOP challenge 2022

Authors: Sándor P. Fekete Phillip Keldenich Dominik Krupke et al.

Source: ACM Journal of Experimental Algorithmics. 28:1-13

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, intersection graphs, 01 natural sciences, CG:SHOP, Computer Science - Data Structures and Algorithms, computational geometry, graph coloring, Computer Science - Computational Geometry, geometric optimization, Data Structures and Algorithms (cs.DS), F.2.2, algorithm engineering, plane subgraphs, Algorithms in computer science

File Description: application/xml

Access URL: http://arxiv.org/abs/2203.07444
https://zbmath.org/7887807
https://doi.org/10.1145/3604907

Improved Bounds for Metric Capacitated Covering Problems: Improved bounds for metric capacitated covering problems

Authors: Sayan Bandyapadhyay

Contributors: Sayan Bandyapadhyay

Source: Algorithmica. 85:1825-1849

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Capacitated covering, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph theory, bicriteria approximation, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, approximation algorithms, Algorithms in computer science, LP rounding, capacitated covering, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2006.12454
https://zbmath.org/7704062
https://doi.org/10.1007/s00453-022-01084-x
https://drops.dagstuhl.de/opus/volltexte/2020/12875/pdf/LIPIcs-ESA-2020-9.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12875/
https://arxiv.org/abs/2006.12454
https://doi.org/10.4230/LIPIcs.ESA.2020.9
https://dblp.uni-trier.de/db/journals/corr/corr2006.html#abs-2006-12454
https://arxiv.org/pdf/2006.12454
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.9

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring: Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring

Authors: Loïc Crombez Guilherme D. Da Fonseca Florian Fontan et al.

Contributors: Loïc Crombez Guilherme D. Da Fonseca Florian Fontan et al.

Source: ACM Journal of Experimental Algorithmics. 28:1-13

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, 0211 other engineering and technologies, Constraint Satisfaction Problems, CG:SHOP 2022, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, Graph Coloring, Computer Science - Data Structures and Algorithms, graph coloring, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), DIMACS, constraint satisfaction problems, Algorithms in computer science

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2303.09632
https://zbmath.org/7887804
https://doi.org/10.1145/3588869
https://hal.science/hal-04051492v1/document
https://doi.org/10.1145/3588869
https://hal.science/hal-04051492v1