English
Related papers

Related papers: Continuous Location under Refraction

200 papers

We study the complexity of identifying the integer feasibility of reverse convex sets. We present various settings where the complexity can be either NP-Hard or efficiently solvable when the dimension is fixed. Of particular interest is the…

Optimization and Control · Mathematics 2024-09-10 Robert Hildebrand , Adrian Göß

The nearest neighbor problem is defined as follows: Given a set $P$ of $n$ points in some metric space $(X,D)$, build a data structure that, given any point $q$, returns a point in $P$ that is closest to $q$ (its "nearest neighbor" in $P$).…

Data Structures and Algorithms · Computer Science 2018-06-27 Alexandr Andoni , Piotr Indyk , Ilya Razenshteyn

We have developed an approach allowing us to resolve the problem of non-conventional Anderson localization emerging in bilayered periodic-on-average structures with alternating layers of right-handed and left-handed materials. Recently, it…

Disordered Systems and Neural Networks · Physics 2012-05-15 E. J. Torres-Herrera , F. M. Izrailev , N. M. Makarov

This paper considers a new bootstrap procedure to estimate the distribution of high-dimensional $\ell_p$-statistics, i.e. the $\ell_p$-norms of the sum of $n$ independent $d$-dimensional random vectors with $d \gg n$ and $p \in [1,…

Statistics Theory · Mathematics 2020-08-18 Alexander Giessing , Jianqing Fan

Locating a target is key in many applications, namely in high-stakes real-world scenarios, like detecting humans or obstacles in vehicular networks. In scenarios where precise statistics of the measurement noise are unavailable,…

Optimization and Control · Mathematics 2022-08-17 João Domingos , Cláudia Soares , João Xavier

The paper provides a description of the large deviation behavior for the Euclidean norm of projections of $\ell_p^n$-balls to high-dimensional random subspaces. More precisely, for each integer $n\geq 1$, let $k_n\in\{1,\ldots,n-1\}$,…

Probability · Mathematics 2017-06-20 David Alonso-Gutiérrez , Joscha Prochno , Christoph Thaele

This paper pursues a twofold goal. First, we introduce and study in detail a new notion of variational analysis called generalized metric subregularity, which is a far-going extension of the conventional metric subregularity conditions. Our…

Optimization and Control · Mathematics 2024-06-21 Guoyin Li , Boris Mordukhovich , Jiangxing Zhu

Robust relocalization in dynamic outdoor environments remains a key challenge for autonomous systems relying on 3D lidar. While long-term localization has been widely studied, short-term environmental changes, occurring over days or weeks,…

The first purpose of this paper is to provide a rigorous proof for the nonconvergence of $h$-refinement in $hp$-approximation by the PSWFs, a surprising convergence property that was first observed by Boyd et al [J. Sci. Comput., 2013]. The…

Numerical Analysis · Mathematics 2015-06-17 Li-Lian Wang , Jing Zhang , Zhimin Zhang

LiDAR relocalization aims to estimate the global 6-DoF pose of a sensor in the environment. However, existing regression-based approaches are prone to dynamic or ambiguous scenarios, as they either solely rely on single-frame inference or…

Computer Vision and Pattern Recognition · Computer Science 2026-02-04 Minghang Zhu , Zhijing Wang , Yuxin Guo , Wen Li , Sheng Ao , Cheng Wang

Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…

Combinatorics · Mathematics 2009-01-07 Oleg R. Musin

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

Consider the task of locating an unknown target point using approximate distance queries: in each round, a reconstructor selects a query point and receives a noisy version of its distance to the target. This problem arises naturally in…

Machine Learning · Computer Science 2025-11-11 Shay Moran , Elizaveta Nesterova

Depth measures quantify central tendency in the analysis of statistical and geometric data. Selecting a depth measure that is simple and efficiently computable is often important, e.g., when calculating depth for multiple query points or…

Computational Geometry · Computer Science 2024-11-12 Amirhossein Mashghdoust , Stephane Durocher

The ability to measure similarity between documents enables intelligent summarization and analysis of large corpora. Past distances between documents suffer from either an inability to incorporate semantic similarities between words or from…

Machine Learning · Computer Science 2019-11-05 Mikhail Yurochkin , Sebastian Claici , Edward Chien , Farzaneh Mirzazadeh , Justin Solomon

We introduce a new method for location recovery from pair-wise directions that leverages an efficient convex program that comes with exact recovery guarantees, even in the presence of adversarial outliers. When pairwise directions represent…

Computer Vision and Pattern Recognition · Computer Science 2016-08-09 Thomas Goldstein , Paul Hand , Choongbum Lee , Vladislav Voroninski , Stefano Soatto

We study a variant of the competitive facility location problem, in which a company is to locate new facilities in a market where competitor's facilities already exist. We consider the scenario where only a limited number of possible…

Optimization and Control · Mathematics 2020-02-25 Yun Hui Lin , Qingyun Tian

The two-dimensional hyperbolic plane, $\mathbb{H}^2$, is an unusual system in that dimensionality changes with scale: locally two-dimensional and planar at short distances, but effectively infinite-dimensional at large scales, it provides…

Disordered Systems and Neural Networks · Physics 2026-04-29 Alexander Altland , Tobias Micklitz , Devasheesh Sharma , Maksimilian Usoltcev , Carolin Wille

We study the problem of non-conventional Anderson localization emerging in bilayer periodic-on-average structures with alternating layers of materials with positive and negative refraction indices $n_a$ and $n_b$. Main attention is paid to…

Disordered Systems and Neural Networks · Physics 2015-06-15 E. J. Torres-Herrera , F. M. Izrailev , N. M. Makarov

We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…

Algebraic Geometry · Mathematics 2026-03-16 Sandra Di Rocco , Kemal Rose , Luca Sodomaco