Search
Search Results
-
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...
-
Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers
Cryptanalysis of modern symmetric ciphers may be done by using linear equation systems with multiple right hand sides, which describe the encryption...
-
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"...
-
Bases for Riemann–Roch spaces of linearized function fields with applications to generalized algebraic geometry codes
Several applications of function fields over finite fields, or equivalently, algebraic curves over finite fields, require computing bases for...
-
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...
-
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...
-
Optimal ternary locally repairable codes
Locally repairable codes (LRCs) are linear codes with locality properties for code symbols, which have important applications in distributed storage...
-
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...
-
Circular external difference families: construction and non-existence
The circular external difference family and its strong version are of great significance both in theory and in applications. In this paper, we apply...
-
External codes for multiple unicast networks via interference alignment
We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and...
-
PECC: parallel expansion based on clustering coefficient for efficient graph partitioning
In the pursuit of graph processing performance, graph partitioning, as a crucial preprocessing step, has been widely concerned. Based on an in-depth...
-
On prefer-one sequences
We study the sequences generated by prefer-one rule with different initial vectors. Firstly, we give upper bounds of their periods and for initial...
-
On the classification of skew Hadamard matrices of order \(\varvec{36}\) and related structures
Two skew Hadamard matrices are considered
SH -equivalent if they are similar by a signed permutation matrix. This paper determines the number ofSH -ine... -
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...
-
Indicator functions, v-numbers and Gorenstein rings in the theory of projective Reed–Muller-type codes
For projective Reed–Muller-type codes we give a global duality criterion in terms of the v-number and the Hilbert function of a vanishing ideal. As...
