{"results":[{"id":"arxiv_2504.11299","title":"Efficient and Stable Multi-Dimensional Kolmogorov-Smirnov Distance","authors":[{"name":"Peter Matthew Jacobs"},{"name":"Foad Namjoo"},{"name":"Jeff M. Phillips"}],"abstract":"We revisit extending the Kolmogorov-Smirnov distance between probability distributions to the multidimensional setting and make new arguments about the proper way to approach this generalization. Our proposed formulation maximizes the difference over orthogonal dominating rectangular ranges (d-sided rectangles in R^d), and is an integral probability metric. We also prove that the distance between a distribution and a sample from the distribution converges to 0 as the sample size grows, and bound this rate. Moreover, we show that one can, up to this same approximation error, compute the distance efficiently in 4 or fewer dimensions; specifically the runtime is near-linear in the size of the sample needed for that error. With this, we derive a delta-precision two-sample hypothesis test using this distance. Finally, we show these metric and approximation properties do not hold for other popular variants.","source":"arXiv","year":2025,"language":"en","subjects":["stat.CO","cs.CG","cs.LG"],"url":"https://arxiv.org/abs/2504.11299","pdf_url":"https://arxiv.org/pdf/2504.11299","is_open_access":true,"published_at":"2025-04-15T15:42:49Z","score":69},{"id":"crossref_10.1109/icdcs59278.2024.10560710","title":"Performance and Evaluation of CG-CS LNA over Gain and Noise Optimization","authors":[{"name":"Soundarya V"},{"name":"A. Alfred Kirubaraj"},{"name":"S. Senith"}],"abstract":"","source":"CrossRef","year":2024,"language":"en","subjects":null,"doi":"10.1109/icdcs59278.2024.10560710","url":"https://doi.org/10.1109/icdcs59278.2024.10560710","is_open_access":true,"published_at":"","score":68},{"id":"crossref_10.1016/j.mee.2023.112043","title":"Quad path, CG-CS resistive feedback LNA architecture for 25–35 GHz band","authors":[{"name":"Dheeraj Kalra"},{"name":"Vishal Goyal"},{"name":"Mayank Srivastava"}],"abstract":"","source":"CrossRef","year":2023,"language":"en","subjects":null,"doi":"10.1016/j.mee.2023.112043","url":"https://doi.org/10.1016/j.mee.2023.112043","is_open_access":true,"citations":3,"published_at":"","score":67.09},{"id":"arxiv_2309.15199","title":"Generalised 3D Morton and Hilbert Orderings","authors":[{"name":"David Walker"}],"abstract":"This document describes algorithms for generating general Morton and Hilbert orderings for three-dimensional data volumes.","source":"arXiv","year":2023,"language":"en","subjects":["cs.CG","cs.DS"],"url":"https://arxiv.org/abs/2309.15199","pdf_url":"https://arxiv.org/pdf/2309.15199","is_open_access":true,"published_at":"2023-09-26T18:56:29Z","score":67},{"id":"crossref_10.1016/j.htct.2022.09.486","title":"PÚRPURA TROMBOCITOPÊNICA TROMBÓTICA PÓS-COVID-19","authors":[{"name":"CG Carneiro"},{"name":"DSC Quaresma"},{"name":"JL Vieitas"},{"name":"CS Cunha"},{"name":"CD Militão"}],"abstract":"","source":"CrossRef","year":2022,"language":"en","subjects":null,"doi":"10.1016/j.htct.2022.09.486","url":"https://doi.org/10.1016/j.htct.2022.09.486","is_open_access":true,"published_at":"","score":66},{"id":"arxiv_1904.05173","title":"Combinatorial constructions of intrinsic geometries","authors":[{"name":"Stanislaw Ambroszkiewicz"}],"abstract":"A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the construction is sufficiently regular and uniform, then the notions of metric, geodesic and curvature can be defined in the space as the limits of their finite versions in the graphs. This gives rise to consider the graphs with metrics as finite approximations of the geometry of the space. On the basis of simple and generic examples, several nonstandard and novel notions are proposed for the Foundations of Geometry. They may be considered as a subject of a critical discussion.","source":"arXiv","year":2019,"language":"en","subjects":["cs.CG","math.DG"],"url":"https://arxiv.org/abs/1904.05173","pdf_url":"https://arxiv.org/pdf/1904.05173","is_open_access":true,"published_at":"2019-04-10T13:21:08Z","score":63},{"id":"arxiv_1910.05388","title":"A Proof of Levi's Extension Lemma","authors":[{"name":"Marcus Schaefer"}],"abstract":"We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.","source":"arXiv","year":2019,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/1910.05388","pdf_url":"https://arxiv.org/pdf/1910.05388","is_open_access":true,"published_at":"2019-10-11T19:54:36Z","score":63},{"id":"arxiv_1709.02433","title":"Addendum to: Edge-Unfolding Nearly Flat Convex Caps","authors":[{"name":"Joseph O'Rourke"}],"abstract":"This addendum to [O'R17] establishes that a nearly flat acutely triangulated convex cap in the sense of that paper can be edge-unfolded even if closed to a polyhedron by adding the convex polygonal base under the cap.","source":"arXiv","year":2017,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/1709.02433","pdf_url":"https://arxiv.org/pdf/1709.02433","is_open_access":true,"published_at":"2017-09-02T19:50:40Z","score":61},{"id":"arxiv_1512.01485","title":"Flips in Edge-Labelled Pseudo-Triangulations","authors":[{"name":"Prosenjit Bose"},{"name":"Sander Verdonschot"}],"abstract":"We show that $O(n^2)$ exchanging flips suffice to transform any edge-labelled pointed pseudo-triangulation into any other with the same set of labels. By using insertion, deletion and exchanging flips, we can transform any edge-labelled pseudo-triangulation into any other with $O(n \\log c + h \\log h)$ flips, where $c$ is the number of convex layers and $h$ is the number of points on the convex hull.","source":"arXiv","year":2015,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/1512.01485","pdf_url":"https://arxiv.org/pdf/1512.01485","is_open_access":true,"published_at":"2015-12-04T17:23:37Z","score":59},{"id":"arxiv_1304.6296","title":"Hilbert curves in 2 dimensions generated by L-systems","authors":[{"name":"Arie Bos"}],"abstract":"Generating Hilbert curves in Z^2 using L-systems appears to be efficient and easy","source":"arXiv","year":2013,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/1304.6296","pdf_url":"https://arxiv.org/pdf/1304.6296","is_open_access":true,"published_at":"2013-04-23T14:20:40Z","score":57},{"id":"arxiv_1311.5447","title":"Reducing Linear Programs into Min-max Problems","authors":[{"name":"Carmi Grushko"}],"abstract":"We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.","source":"arXiv","year":2013,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/1311.5447","pdf_url":"https://arxiv.org/pdf/1311.5447","is_open_access":true,"published_at":"2013-11-21T15:29:30Z","score":57},{"id":"arxiv_1210.7123","title":"Index notation of grid graphs","authors":[{"name":"Arie Bos"}],"abstract":"By defining grids as graphs, geometric graphs can be represented in a very concise way.","source":"arXiv","year":2012,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/1210.7123","pdf_url":"https://arxiv.org/pdf/1210.7123","is_open_access":true,"published_at":"2012-10-26T12:44:14Z","score":56},{"id":"doaj_10.46298/dmtcs.2995","title":"Adaptive compression against a countable alphabet","authors":[{"name":"Dominique Bontemps"},{"name":"Stephane Boucheron"},{"name":"Elisabeth Gassiat"}],"abstract":"This paper sheds light on universal coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and non-decreasing hazard rate. We prove that the auto-censuring (AC) code introduced by Bontemps (2011) is adaptive with respect to the collection of such classes. The analysis builds on the tight characterization of universal redundancy rate in terms of metric entropy by Haussler and Opper (1997) and on a careful analysis of the performance of the AC-coding algorithm. The latter relies on non-asymptotic bounds for maxima of samples from discrete distributions with finite and non-decreasing hazard rate.","source":"DOAJ","year":2012,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.2995","url":"https://dmtcs.episciences.org/2995/pdf","pdf_url":"https://dmtcs.episciences.org/2995/pdf","is_open_access":true,"published_at":"","score":56},{"id":"doaj_10.46298/dmtcs.2984","title":"Additive tree functionals with small toll functions and subtrees of random trees","authors":[{"name":"Stephan Wagner"}],"abstract":"Many parameters of trees are additive in the sense that they can be computed recursively from the sum of the branches plus a certain toll function. For instance, such parameters occur very frequently in the analysis of divide-and-conquer algorithms. Here we are interested in the situation that the toll function is small (the average over all trees of a given size $n$ decreases exponentially with $n$). We prove a general central limit theorem for random labelled trees and apply it to a number of examples. The main motivation is the study of the number of subtrees in a random labelled tree, but it also applies to classical instances such as the number of leaves.","source":"DOAJ","year":2012,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.2984","url":"https://dmtcs.episciences.org/2984/pdf","pdf_url":"https://dmtcs.episciences.org/2984/pdf","is_open_access":true,"published_at":"","score":56},{"id":"doaj_10.46298/dmtcs.3012","title":"Infinite Systems of Functional Equations and Gaussian Limiting Distributions","authors":[{"name":"Michael Drmota"},{"name":"Bernhard Gittenberger"},{"name":"Johannes F. Morgenbesser"}],"abstract":"In this paper infinite systems of functional equations in finitely or infinitely many random variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in the generating function of the system tend to a finite or infinite dimensional limiting distribution.","source":"DOAJ","year":2012,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.3012","url":"https://dmtcs.episciences.org/3012/pdf","pdf_url":"https://dmtcs.episciences.org/3012/pdf","is_open_access":true,"published_at":"","score":56},{"id":"arxiv_0908.3716","title":"Carnival of Samplings: Nets, Approximations, Relative and Sensitive","authors":[{"name":"Sariel Har-Peled"}],"abstract":"We survey several results known on sampling in computational geometry.","source":"arXiv","year":2009,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/0908.3716","pdf_url":"https://arxiv.org/pdf/0908.3716","is_open_access":true,"published_at":"2009-08-26T01:44:49Z","score":53},{"id":"arxiv_0907.0907","title":"Randomized Incremental Construction of Compressed Quadtrees","authors":[{"name":"Sariel Har-Peled"}],"abstract":"We present a simple randomized incremental algorithm for building compressed quadtrees. The resulting algorithm seems to be simpler than previously known algorithms for this task.","source":"arXiv","year":2009,"language":"en","subjects":["cs.CG"],"url":"https://arxiv.org/abs/0907.0907","pdf_url":"https://arxiv.org/pdf/0907.0907","is_open_access":true,"published_at":"2009-07-06T03:03:42Z","score":53},{"id":"crossref_10.1093/ajcn/58.1.103","title":"Vitamin C elevates red blood cell glutathione in healthy adults","authors":[{"name":"CS Johnston"},{"name":"CG Meyer"},{"name":"JC Srilakshmi"}],"abstract":"","source":"CrossRef","year":1993,"language":"en","subjects":null,"doi":"10.1093/ajcn/58.1.103","url":"https://doi.org/10.1093/ajcn/58.1.103","is_open_access":true,"citations":90,"published_at":"","score":52.7},{"id":"doaj_10.46298/dmtcs.3518","title":"Expected values of statistics on permutation tableaux","authors":[{"name":"Sylvie Corteel"},{"name":"Pawel Hitczenko"}],"abstract":"Permutation tableaux are new objects that were introduced by Postnikov in the context of enumeration of the totally positive Grassmannian cells. They are known to be in bijection with permutations and recently, they have been connected to PASEP model used in statistical physics. Properties of permutation tableaux became a focus of a considerable research activity. In this paper we study properties of basic statistics defined on permutation tableaux. We present a simple and unified approach based on probabilistic techniques and use it to compute the expected values of basic statistics defined on permutation tableaux. We also provide a non―bijective and very simple proof that there are n! permutation tableaux of length n.","source":"DOAJ","year":2007,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.3518","url":"https://dmtcs.episciences.org/3518/pdf","pdf_url":"https://dmtcs.episciences.org/3518/pdf","is_open_access":true,"published_at":"","score":51},{"id":"doaj_10.46298/dmtcs.3547","title":"On expected number of maximal points in polytopes","authors":[{"name":"Yu. Baryshnikov"}],"abstract":"We answer an old question: what are possible growth rates of the expected number of vector-maximal points in a uniform sample from a polytope.","source":"DOAJ","year":2007,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.3547","url":"https://dmtcs.episciences.org/3547/pdf","pdf_url":"https://dmtcs.episciences.org/3547/pdf","is_open_access":true,"published_at":"","score":51}],"total":88920,"page":1,"page_size":20,"sources":["CrossRef","arXiv","DOAJ"],"query":"cs.CG"}