Related papers: On the travel time tomography problem in 3D
Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking…
Three-dimensional melting problems are investigated numerically with Lattice Boltzmann method (LBM). Regarding algorithm's accuracy and stability, Multiple-Relaxation-Time (MRT) models are employed to simplify the collision term in LBM.…
In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…
We study a nonparametric Bayesian approach to linear inverse problems under discrete observations. We use the discrete Fourier transform to convert our model into a truncated Gaussian sequence model, that is closely related to the classical…
In linear transport theory, three-dimensional equations reduce to one-dimensional equations by means of rotated reference frames. In this paper, we illustrate how the technique works and three-dimensional transport theories are obtained.
The problem of imaging extended targets (sources or scatterers) is formulated in the framework of compressed sensing with emphasis on subwavelength resolution. The proposed formulation of the problems of inverse source/scattering is…
This paper focuses on the resolution of infinite-dimensional Toeplitz Block LMIs, which are frequently encountered in the context of stability analysis and control design problems formulated in the harmonic framework. We propose a…
Line features are valid complements for point features in man-made environments. 3D-2D constraints provided by line features have been widely used in Visual Odometry (VO) and Structure-from-Motion (SfM) systems. However, how to accurately…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
The paper considers a linear system of Boltzmann transport equations modelling the evolution of three species of particles, photons, electrons and positrons. The system is coupled because of the collision term (an integral operator). The…
We analyze two classic variants of the Traveling Salesman Problem using the toolkit of fine-grained complexity. Our first set of results is motivated by the Bitonic TSP problem: given a set of $n$ points in the plane, compute a shortest…
Transport-Based Morphometry (TBM) has emerged as a new framework for 3D medical image analysis. By embedding images into a transport domain via invertible transformations, TBM facilitates effective classification, regression, and other…
A Coefficient Inverse Problem for the radiative transport equation is considered. The globally convergent numerical method, the so-called convexification, is developed. For the first time, the viscosity solution is considered for a boundary…
We consider transportation networks that are modeled by dynamic graphs, and introduce the possibility for traveling agents to use Backward Time-Travel (BTT) devices at any node to go back in time (to some extent, and with some appropriate…
Estimating the travel time of any route is of great importance for trip planners, traffic operators, online taxi dispatching and ride-sharing platforms, and navigation provider systems. With the advance of technology, many traveling cars,…
Consider a data set collected by (individuals-features) pairs in different times. It can be represented as a tensor of three dimensions (Individuals, features and times). The tensor biclustering problem computes a subset of individuals and…
Transportation planning depends on predictions of the travel times between loading and unloading locations. While accurate techniques exist for making deterministic predictions of travel times based on real-world data, making stochastic…
We study the structure of solutions to linear programming formulations for the traveling salesperson problem (TSP). We perform a detailed analysis of the support of the subtour elimination linear programming relaxation, which leads to…
Spatio-Temporal Multivariate time series Forecast (STMF) uses the time series of $n$ spatially distributed variables in a period of recent past to forecast their values in a period of near future. It has important applications in…
In route selection problems, the driver's personal preferences will determine whether she prefers a route with a travel time that has a relatively low mean and high variance over one that has relatively high mean and low variance. In…