Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199419922001200920172026
48 results for line segment probability

Santaló calculated the measures for all positions of a moving line segment in which it lies inside a fixed circle and intersects this circle in one or two points. From these measures he concluded hitting probabilities for a line segment thrown randomly onto an unbounded lattice of circles. In the present paper these re…

2016-12-06abs ↗pdf ↗

The paper explores reflection principles for lightlike line segments on maximal surfaces.

problem Reflection property does not hold for lightlike line segments on maximal surfaces.
method Analyzes reflection properties for lightlike line segments connecting shrinking singularities.
result Shows a kind of reflection principle for lightlike line segments on maximal surfaces.

Rectangular diagrams of links are link diagrams in the plane R2{\mathbb R}^2 such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. P. R. Cromwell and I. A. Dynnikov showed that rectangular diagrams of links are useful for d…

2014-05-27abs ↗pdf ↗

In this paper, we compute the derivatives of the line segment energy for a symmetric tensor field and apply them to obtain slightly more general log-concavity estimates for positive solutions of heat equations and first eigenfunctions on bounded strictly convex domains.

2015-09-04abs ↗pdf ↗

A new snake model improves segmentation of SEM images.

problem Efficiently segmenting overlapping electronic structures in SEM images.
method Geodesic tracking on projective line bundle with a geometric criterion for switching between fast spatial snakes and minimizing geodesics.
result Improved robust and automatic segmentation of overlapping electronic structures in SEM images.

We provide a proof and analyze the asymptotic behavior of a formula for the linking number of line segments.

problem The invariant formula for the linking number of line segments and its asymptotic behavior.
method Detailed proof and asymptotic analysis of the formula.
result We provide a proof and analyze the asymptotic behavior of the formula for the linking number of line segments.

Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is calculated as the product of the probabilities of all its segments, where each segment …

2017-02-24abs ↗pdf ↗

The aim of this paper is to develop a new axiomatization of planar geometry by reinterpreting the original axioms of Euclid. The basic concept is still that of a line segment but its equivalent notion of betweenness is viewed as a topological, not a metric concept. That leads quickly to the notion of connectedness with…

2015-01-01abs ↗pdf ↗

Given a compact closed subset MM of a line segment in R3\mathbb{R}^3, we construct a sequence of minimal surfaces ΣkΣ_k embedded in a neighborhood CC of the line segment that converge smoothly to a limit lamination of CC away from MM. Moreover, the curvature of this sequence blows up precisely on MM, and the limit…

2009-10-01abs ↗pdf ↗

Algorithm recovers spike direction from modulo-reduced measurements in high dimensions.

problem Recovering spike direction from modulo-reduced measurements in high-dimensional space.
method Developed an algorithm for estimating the spike direction using modulo-reduced measurements.
result Algorithm accurately estimates the spike direction with n=poly(k)n=\mathrm{poly}(k) measurements when ΔlogkΔ\gtrsim \sqrt{\log k}.

This paper finds a unique partition of a sample space for estimating continuous distributions.

problem Estimating continuous probability distributions from finite samples.
method Equal-probability partition of the sample space using order statistics.
result The partition yields an entropy of log2(N+1) bits, providing a discrete entropy estimate.

Hilbert's fourth problem asks for the construction and the study of metrics on subsets of projective space for which the projective line segments are geodesics. Several solutions of the problem were given so far, depending on more precise interpretations of this problem, with various additional conditions satisfied. Th…

2013-12-11abs ↗pdf ↗

It is shown that the tessellation of a compact, negatively curved surface induced by a typical long geodesic segment, when properly scaled, looks locally like a Poisson line process. This implies that the global statistics of the tessellation -- for instance, the fraction of triangles -- approach those of the limiting …

2017-08-31abs ↗pdf ↗

New proof of log-Brunn-Minkowski inequality for zonoids and convex bodies.

problem Proving the log-Brunn-Minkowski inequality for convex bodies and zonoids.
method Establishing monotonicity of the deficit in the LLBM under line segment addition.
result Equality in LLBM for smooth convex bodies occurs only for homothetic bodies.

We discuss Darboux-Staude type of thread configurations for the ellipsoid similar to Chasles-Graves type of thread configurations for the ellipse. These threads are formed by rectilinear segments, geodesic and line of curvature segments on the considered ellipsoid and with tangents tangent to the given ellipsoid and a …

2009-02-09abs ↗pdf ↗

Two methods improve 10-K item segmentation using large language models.

problem Challenges in extracting specific items from 10-K reports due to variations in document formats and item presentation.
method Two advanced item segmentation methods: GPT4ItemSeg and BERT4ItemSeg.
result BERT4ItemSeg achieves a macro-F1 of 0.9825, surpassing other methods.

The stick index of a knot is the least number of line segments required to build the knot in space. We define two analogous 2-dimensional invariants, the planar stick index, which is the least number of line segments in the plane to build a projection, and the spherical stick index, which is the least number of great c…

2011-08-29abs ↗pdf ↗

New method estimates corporate default probabilities using indirect data.

problem Lack of direct default rate data for corporate companies.
method Modeling default probability dynamics using Bank of Russia overdue debt data.
result Validated method produces trustworthy default probability series.

Study of polygon degeneration to segments in complex space.

problem Understanding the space of polygons degenerated to segments.
method Proved L(n)\mathbb{L}(n) is a smooth submanifold, described its topology, computed geodesics, and quotiented the space.
result Found that L(n)\mathbb{L}(n) and M(n)\mathbb{M}(n) contain straight lines forming a basis of directions in their tangent spaces.

We list all analytic diffeomorphisms between an open subset of the 4-dimensional projective space and an open subset of the 4-dimensional sphere that take all line segments to arcs of round circles. These are the following: restrictions of the quaternionic Hopf fibrations and projections from a hyperplane to a sphere f…

2003-09-03abs ↗pdf ↗

Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.

problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.

Segmentation of anatomical structures and pathologies is inherently ambiguous. For instance, structure borders may not be clearly visible or different experts may have different styles of annotating. The majority of current state-of-the-art methods do not account for such ambiguities but rather learn a single mapping f…

2019-06-07abs ↗pdf ↗

Algorithm generates adaptive confidence sets for instance segmentation with guaranteed coverage.

problem Uncalibrated predictions and lack of uncertainty quantification in instance segmentation models.
method Conformal prediction algorithm to generate adaptive confidence sets with provable guarantees.
result Empirically, prediction sets vary in size based on query difficulty and attain target coverage, outperforming baselines.

Let MM be a differentiable manifold and TMTM be its tangent bundle. A C0C^0-Finsler structure on MM is a continuous function F:TMRF: TM \rightarrow \mathbb R such that its restriction to each tangent space is a norm. In this work we present a large family of projectively equivalent C0C^0-Finsler manifolds $(\hat M \cong…

2018-07-28abs ↗pdf ↗

The lattice stick number sL(L)s_L(L) of a link LL is defined to be the minimal number of straight line segments required to construct a stick presentation of LL in the cubic lattice. Hong, No and Oh found a general upper bound sL(K)3c(K)+2s_L(K) \leq 3 c(K) +2. A rational link can be represented by a lattice presentation with exa…

2018-05-01abs ↗pdf ↗

We establish geometric and topological properties of the space of value functions in finite state-action Markov decision processes. Our main contribution is the characterization of the nature of its shape: a general polytope (Aigner et al., 2010). To demonstrate this result, we exhibit several properties of the structu…

2019-01-31abs ↗pdf ↗

A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the quadrisecant approximation of the original knot. It was conjectured that the quadrisecan…

2016-05-02abs ↗pdf ↗

We consider the limit set in Thurston's compactification PMF of Teichmueller space of some Teichmueller geodesics defined by quadratic differentials with minimal but not uniquely ergodic vertical foliations. We show that a) there are quadratic differentials so that the limit set of the geodesic is a unique point, b) th…

2014-06-03abs ↗pdf ↗

We construct minimal laminations with prescribed singularities on a line segment using perturbation techniques and PDE methods. In addition to the singular set, the rate of curvature blowup is also prescribable in our construction, and we show that all curvature blowup rates between quadratic and quartic arise. Our res…

2014-10-13abs ↗pdf ↗