Related papers: Spatial-photonic Ising machine by space-division m…
Constructing realistic digital twins for applications such as training autonomous driving models requires the efficient allocation of real-world data, yet data sovereignty regulations present a major challenge. To address this, we tackle…
The Ising model, originally proposed a century ago, has become a cornerstone of combinatorial optimization in recent decades. However, Ising machines remain constrained by a fundamental hardware-speed trade-off. We introduce the Bounce-Bind…
Motivated by recent work on studying massive imaging data in various neuroimaging studies, we propose a novel spatially varying coefficient model (SVCM) to spatially model the varying association between imaging measures in a…
Online augmentation of an oblique aerial image sequence with structural information is an essential aspect in the process of 3D scene interpretation and analysis. One key aspect in this is the efficient dense image matching and depth…
Distributed-Multiple Input Multiple Output (DMIMO) networks is a promising enabler to address the challenges of high traffic demand in future wireless networks. A limiting factor that is directly related to the performance of these systems…
This paper describes an experimental setup that has been developed to measure and characterise properties of Silicon Photomultipliers (SiPM). The measured SiPM properties are of general interest for a multitude of potential applications and…
Programmable optical devices provide performance enhancement and flexibility to spatial multiplexing systems enabling transmission of tributaries in high-order eigenmodes of spatially-diverse transmission media, like multimode fiber (MMF).…
Many combinatorial optimization problems (COPs) are naturally expressed using variables that take on more than two discrete values. To solve such problems using Ising machines (IMs) - specialized analog or digital devices designed to solve…
Provided that Supersymmetry (SUSY) is realized, the Large Hadron Collider (LHC) and the future International Linear Collider (ILC) may provide a wealth of precise data from SUSY processes. An important task will be to extract the Lagrangian…
Recently, the coherent Ising machine (CIM) as a degenerate optical parametric oscillator (DOPO) network has been researched to solve Ising combinatorial optimization problems. We formulate a theoretical model for the CIM with discrete-time…
In this paper we generalize the Interior Point-Proximal Method of Multipliers (IP-PMM) presented in [An Interior Point-Proximal Method of Multipliers for Convex Quadratic Programming, Computational Optimization and Applications, 78,…
This work focuses on support vector machine (SVM) with feature selection. A MILP formulation is proposed for the problem. The choice of suitable features to construct the separating hyperplanes has been modelled in this formulation by…
Simulated annealing (SA) attracts more attention among classical heuristic algorithms because the solution of the combinatorial optimization problem can be naturally mapped to the ground state of the Ising Hamiltonian. However, in practical…
We apply the notion of asymptotic iteration method (AIM) to determine eigenvalues of the bosonic Hamiltonians that include a wide class of quantum optical models. We consider solutions of the Hamiltonians, which are even polynomials of the…
Fast and sensitive detector arrays enable image scanning microscopy (ISM), overcoming the trade-off between spatial resolution and signal-to-noise ratio (SNR) typical of confocal microscopy. However, current ISM approaches cannot provide…
Lifting is a crucial technique in mixed integer programming (MIP) for generating strong valid inequalities, which serve as cutting planes to improve the branch-and-cut algorithm. We first propose an exact sequential lifting algorithm for…
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses.…
In simultaneous localization and mapping (SLAM), image feature point matching process consume a lot of time. The capacity of low-power systems such as embedded systems is almost limited. It is difficult to ensure the timely processing of…
Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. The Ising model is of fundamental computational interest because it is possible to formulate any problem in the complexity…
This letter describes an incremental multimodal surface mapping methodology, which represents the environment as a continuous probabilistic model. This model enables high-resolution reconstruction while simultaneously compressing spatial…