Results 1 to 10 of about 341,353 (194)
String Matching and 1d Lattice Gases [PDF]
, 2005 We calculate the probability distributions for the number of occurrences $n$ of a given $l$ letter word in a random string of $k$ letters. Analytical expressions for the distribution are known for the asymptotic regimes (i) $k \gg r^l \gg 1$ (Gaussian ...
A. D. Barbour +38 more
core +1 more source
Stabbing line segments with disks: complexity and approximation algorithms [PDF]
, 2017 Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line drawing $G=(V,E)$ of
Kobylkin, Konstantin
core +1 more source
On the Cost of Essentially Fair Clusterings [PDF]
, 2018 Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. However, this process may harm protected (minority) classes if the clustering algorithm does
+6 more
core +2 more sources
Universality of weak selection [PDF]
, 2010 Weak selection, which means a phenotype is slightly advantageous over another, is an important limiting case in evolutionary biology. Recently it has been introduced into evolutionary game theory.
Arne Traulsen +12 more
core +1 more source
Multiscale change-point segmentation: beyond step functions.
, 2019 Modern multiscale type segmentation methods are known to detect multiple change-points with high statistical accuracy, while allowing for fast computation.
Guo, Q., Li, H., Munk, A.
core +2 more sources
Arithmetic complexity via effective names for random sequences [PDF]
, 2012 We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e.
Arslanov M. M. +6 more
core +1 more source
, 2015 Gonchar-Stahl's $\rho^2$-theorem characterizes the rate of convergence of best uniform (Chebyshev) rational approximations (with free poles) for one basic class of analytic functions.
Rakhmanov, E. A.
core +1 more source
On the Window Size for Classification in Changing Environments [PDF]
, 2009 Classification in changing environments (commonly known as concept drift) requires adaptation of the classifier to accommodate the changes. One approach is to keep a moving window on the streaming data and constantly update the classifier on it. Here we
Kuncheva, Ludmila, Zliobaite, Indre
core +1 more source
Complexity of Discrete Energy Minimization Problems
, 2016 Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is known to be NP ...
A Abdelbar +42 more
core +1 more source
Truthful Multi-unit Procurements with Budgets [PDF]
, 2014 We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a ...
A. Archer +8 more
core +2 more sources