Related papers: Slightly smaller splitter networks
In approximating solutions of nonstationary problems, various approaches are used to compute the solution at a new time level from a number of simpler (sub-)problems. Among these approaches are splitting methods. Standard splitting schemes…
An inherent security limitation with the classic multithreaded programming model is that all the threads share the same address space and, therefore, are implicitly assumed to be mutually trusted. This assumption, however, does not take…
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…
The Bidirectional long short-term memory networks (BiLSTM) have been widely used as an encoder in models solving the named entity recognition (NER) task. Recently, the Transformer is broadly adopted in various Natural Language Processing…
Scheduling with assignment restrictions is an important special case of scheduling unrelated machines which has attracted much attention in the recent past. While a lower bound on approximability of 3/2 is known for its most general…
In this paper we describe an iterative operator-splitting method for unbounded operators. We derive error bounds for iterative splitting methods in the presence of unbounded operators and semigroup operators. Here mixed applications of…
We are motivated by the problem of designing a simple distributed algorithm for Peer-to-Peer streaming applications that can achieve high throughput and low delay, while allowing the neighbor set maintained by each peer to be small. While…
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in DeanDup09 that a subsolution…
We introduce unitary network, an oriented architecture for tensor network unitaries. Compared to existing architectures, in a unitary network each local tensor is required to be a unitary matrix upon suitable reshaping. Global unitarity is…
Code search with natural language helps us reuse existing code snippets. Thanks to the Transformer-based pretraining models, the performance of code search has been improved significantly. However, due to the quadratic complexity of…
When performing named entity recognition (NER), entity length is variable and dependent on a specific domain or dataset. Pre-trained language models (PLMs) are used to solve NER tasks and tend to be biased toward dataset patterns such as…
We investigate scenarios where Internet access to a user device (node) is available only via the cellular network. However, not every node may connect directly to it. Instead, some may use tethering to connect over WiFi to a node sharing…
In this note we consider a new variant of network of splicing processors which simplifies the general model such that filters remain associated with nodes but the input and output filters of every node coincide. This variant is called {\it…
We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links…
We consider NCA labeling schemes: given a rooted tree $T$, label the nodes of $T$ with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the label of their nearest common…
This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link…
Contracting tensor networks is often computationally demanding. Well-designed contraction sequences can dramatically reduce the contraction cost. We explore the performance of simulated annealing and genetic algorithms, two common discrete…
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…
The sparsely gated mixture of experts (MoE) architecture sends different inputs to different subnetworks, i.e., experts, through trainable routers. MoE reduces the training computation significantly for large models, but its deployment can…
We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a specified subset $X$ of vertices (terminals) into two parts.…