Latest Articles for Computer Science

This paper examines the size of independent dominating sets in planar triangulations.

rFOM and srFOM improve efficiency in matrix function operations with recycling and sketching.

A new algorithm streamlines R1CS representation for enhanced ZKP clarity and efficiency.

Study reviews FLASH software performance on A64FX computer system for astrophysical simulations.

Exploring how batch normalization and weight decay impact neural network training.

A look into reducing randomness in algorithms using regular ROBPs.

Explore Hamming graphs and their significance in math and research.

A new model enhances detection of cohesive groups in complex networks.

A look at managing confidentiality and integrity in programming languages.

Learn how ideas spread through networks using graph burning concepts.

Cyclic operator precedence grammars improve parsing efficiency and flexibility in programming.

A new method for teaching Rust's ownership concepts improves learner understanding.

Exploring the impact of tensors on dynamic programming efficiency.

This research uses quantum systems to solve complex optimization problems like Max-Cut and MIS.

A novel approach to simplify resource management in multi-threaded applications.

A new model improves how we work with code using intermediate representations.

Methods for local certification of geometric intersection graphs using compact certificates.

Exploring the complexities of spin systems and their computational implications.

An exploration of black hole formation through mathematical models and new techniques.

Learn how quantization makes AI models cheaper and easier to use.

Innovative methods reduce memory use in semidefinite programming for streaming data.

Learn how random feature approximation enhances kernel methods in data analysis.

Cyclic circuits provide a more efficient way to simulate Parallel Random Access Machines.

Explore properties of strict outerconfluent graphs and their width parameters.

Mutation-based fault localization offers a new way to find bugs in DNNs.

This article examines the effectiveness of quantum and classical techniques in integer factorization.

A look at how hooking networks expand and evolve through connections.

Exploring the complex structures of higher category theory and their significance in mathematics.

Research focuses on enhancing message safety during unpredictable network conditions.

Research on complex shapes that defy standard metrics and their properties.

LLMs improve software performance and efficiency in code optimization.

Learn how approximation theory simplifies complex functions for practical applications.

A new approach to graph embedding enhances data analysis through physical force concepts.

Exploring the role of submodular functions in random variables under negative dependence.

A structured approach to check system properties using Computation Tree Logic.

This study improves SNN performance by factoring in axonal signal delays.

A look into improving hash table efficiency through innovative probing methods.

A look into how P2LSG enhances stochastic computing efficiency.

Learn how branch-and-bound tackles complex integer programming challenges with innovative techniques.

CDL aids in studying permutations and arrangements in computer and social sciences.