Comparison of shortest sailing distance through random and regular sampling points
نویسندگان
چکیده
منابع مشابه
Shortest Path through Random Points
Let (M, g1) be a compact d-dimensional Riemannian manifold. Let Xn be a set of n sample points in M drawn randomly from a Lebesgue density f . Define two points x, y ∈ M . We prove that the normalized length of the power-weighted shortest path between x, y passing through Xn converges to the Riemannian distance between x, y under the metric gp = f g1, where p > 1 is the power parameter. The res...
متن کاملShortest Paths in Distance-regular Graphs
We aim here at introducing a new point of view of the Laplacian of a graph, Γ. With this purpose in mind, we consider L as a kernel on the finite space V (Γ), in the context of the Potential Theory. Then we prove that L is a nice kernel, since it verifies some fundamental properties as maximum and energy principles and the equilibrium principle on any proper subset of V (Γ). If Γ is a proper se...
متن کاملHow Many Random Points Can a Regular Curve Pass Through?
Suppose n points are scattered uniformly at random in the unit square [0, 1]. Question: How many of these points can possibly lie on some curves of length λ? Answer, proved here: OP (λ · √ n). We consider a general class of such questions; in each case, we are given a class Γ of curves in the square, and we ask: in a cloud of n uniform random points, how many can lie on some curve γ ∈ Γ? Classe...
متن کاملShortest-Weight Paths in Random Regular Graphs
Consider a random regular graph with degree d and of size n. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed d ≥ 3, we show that the longe...
متن کاملImprovement of Chemical Named Entity Recognition through Sentence-based Random Under-sampling and Classifier Combination
Chemical Named Entity Recognition (NER) is the basic step for consequent information extraction tasks such as named entity resolution, drug-drug interaction discovery, extraction of the names of the molecules and their properties. Improvement in the performance of such systems may affects the quality of the subsequent tasks. Chemical text from which data for named entity recognition is extracte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICES Journal of Marine Science
سال: 2004
ISSN: 1095-9289,1054-3139
DOI: 10.1016/j.icesjms.2003.11.002