Search
Search Results
-
Combinatorial refinement on circulant graphs
The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the...
-
Sublinear Algorithms in T-Interval Dynamic Networks
We consider standard T - interval dynamic networks , under the synchronous timing model and the broadcast CONGEST model. In a T - interval dynamic network ,...
-
Extract Implicit Semantic Friends and Their Influences from Bipartite Network for Social Recommendation
Social recommendation often incorporates trusted social links with user-item interactions to enhance rating prediction. Although methods that...
-
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
We consider the algorithm by Ferson et al. (Reliab Comput 11(3):207--233, 2005) designed for solving the NP-hard problem of computing the maximal...
-
Stagnation Detection in Highly Multimodal Fitness Landscapes
Stagnation detection has been proposed as a mechanism for randomized search heuristics to escape from local optima by automatically increasing the...
-
Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL
We describe the design, implementation and verification of an automated theorem prover for first-order logic with functions. The proof search...
-
Multi-view Heterogeneous Graph Neural Networks for Node Classification
Recently, with graph neural networks (GNNs) becoming a powerful technique for graph representation, many excellent GNN-based models have been...
-
Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel Sorting
We present a stepwise refinement approach to develop verified parallel algorithms, down to efficient LLVM code. The resulting algorithms’ performance...
-
Parameterized Complexity of Streaming Diameter and Connectivity Problems
We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show...
-
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment...
-
Graph-Enhanced Prompt Learning for Personalized Review Generation
Personalized review generation is significant for e-commerce applications, such as providing explainable recommendation and assisting the composition...
-
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
As proposed by Karppa and Kaski (in: Proceedings 30th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019) a novel “broken" or "opportunistic"...
-
General Clauses for SAT-Based Proof Search in Intuitionistic Propositional Logic
In recent years some papers have addressed the problem of the validity in Intuitionistic Propositional Logic (IPL) using the approach proposed by...
-
Channel-Enhanced Contrastive Cross-Domain Sequential Recommendation
Sequential recommendation help users find interesting items by modeling the dynamic user-item interaction sequences. Due to the data sparseness...
-
Gale-Shapley Verified
This paper presents a detailed verification of the Gale-Shapley algorithm for stable matching (or marriage). The verification proceeds by stepwise...
-
Online Unit Profit Knapsack with Predictions
A variant of the online knapsack problem is considered in the setting of predictions. In Unit Profit Knapsack, the items have unit profit, i.e., the...
-
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle
In this paper we consider the following problem: Given a Hamiltonian graph G , and a Hamiltonian cycle C of G , can we compute a second Hamiltonian...
-
Erdos: A Novel Blockchain Consensus Algorithm with Equitable Node Selection and Deterministic Block Finalization
The introduction of blockchain technology has brought about significant transformation in the realm of digital transactions, providing a secure and...
-
Automated Generation of Geometry Proof Problems Based on Point Geometry Identity
The automated generation of geometry proof problems represents a burgeoning research domain in the realm of artificial intelligence, with significant...
-
Formalized Functional Analysis with Semilinear Maps
Semilinear maps are a generalization of linear maps between vector spaces where we allow the scalar action to be twisted by a ring homomorphism such...
