Related papers: SAWdoubler: a program for counting self-avoiding w…
The Word Mover's Distance (WMD) is a metric that measures the semantic dissimilarity between two text documents by computing the cost of moving all words of a source/query document to the most similar words of a target document optimally.…
This paper presents an algorithm for computing the contraction of two-dimensional tensor networks on a square lattice; and we combine it with solving congruence equations to compute the exact enumeration (including weighted enumeration) of…
We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal while avoiding obstacles in uncertain environments. First, we use stochastic model…
We develop a new semi-algebraic proof system called Stabbing Planes which formalizes modern branch-and-cut algorithms for integer programming and is in the style of DPLL-based modern SAT solvers. As with DPLL there is only a single rule:…
This paper proposes a scalable planning algorithm for creating defect-free atom arrays in neutral-atom systems. The algorithm generates a $\mathcal{O}(\sqrt N)$ time plan for $N$ atoms by parallelizing atom transport using a two-dimensional…
We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on…
A Parallel Self-Organizing Map (Parallel-SOM) is proposed to modify Kohonen's SOM in parallel computing environment. In this model, two separate layers of neurons are connected together. The number of neurons in both layers and connections…
This paper introduces a high-throughput software tool framework called {\it sam2bam} that enables users to significantly speedup pre-processing for next-generation sequencing data. The sam2bam is especially efficient on single-node…
We describe a method for fast approximation of sparse coding. The input space is subdivided by a binary decision tree, and we simultaneously learn a dictionary and assignment of allowed dictionary elements for each leaf of the tree. We…
This paper presents a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems. The approach is motivated by first showing that a lattice-based path planner can be…
Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the class of all graphs. Restricting to a specific graph class…
We present refined enumeration formulas for lattice paths in $\mathbb{Z}^2$ with two kinds of steps, by keeping track of the number of descents (i.e., turns in a given direction), the major index (i.e., the sum of the positions of the…
Boolean Satisfiability solvers have gone through dramatic improvements in their performances and scalability over the last few years by considering symmetries. It has been shown that by using graph symmetries and generating symmetry…
Search-based techniques have shown great success in motion planning problems such as robotic navigation by discretizing the state space and precomputing motion primitives. However in domains with complex dynamic constraints, constructing…
We consider path planning for a rigid spatial robot with 6 degrees of freedom (6 DOFs), moving amidst polyhedral obstacles. A correct, complete and practical path planner for such a robot has never been achieved, although this is widely…
We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in…
We apply lessons from fast timing detector R$\&$D to strategies for initial calibration of large timing arrays at future colliders. Detector R$\&$D often benefits from detailed information about the sensor and front-end signal (waveform…
Smart wearable devices (SWDs) collect and store sensitive daily information of many people. Its primary method of identification is still the password unlocking method. However, several studies have shown serious security flaws in that…
We simulate loop-erased random walks on simple (hyper-)cubic lattices of dimensions 2,3, and 4. These simulations were mainly motivated to test recent two loop renormalization group predictions for logarithmic corrections in $d=4$,…
In this paper, a new method is given for counting cycles in the Tanner graph of a (Type-I) quasi-cyclic (QC) low-density parity-check (LDPC) code which the complexity mainly is dependent on the base matrix, independent from the CPM-size of…