Results 21 to 30 of about 9,940 (191)
On weighted sublinear separators [PDF]
Journal of Graph Theory, 2021 AbstractConsider a graph with an assignment of costs to vertices. Even if and all its subgraphs admit balanced separators of sublinear size, may only admit a balanced separator of sublinear cost after deleting a small set of exceptional vertices. We improve the bound on from to , for any fixed number of iterations of the logarithm.
openaire +2 more sources
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
, 2008 In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler +3 more
core +1 more source
Sublinear regret for learning POMDPs
Production and Operations Management, 2022 We study the model‐based undiscounted reinforcement learning for partially observable Markov decision processes (POMDPs). The oracle we consider is the optimal policy of the POMDP with a known environment in terms of the average reward over an infinite horizon.
Yi Xiong +3 more
openaire +3 more sources
08341 Executive Summary – Sublinear Algorithms [PDF]
, 2008 This report summarizes the content and structure of the Dagstuhl seminar `Sublinear Algorithms', which was held from 17.8.2008 to 22.8.2008 in Schloss Dagstuhl ...
Muthukrishnan, S. Muthu +3 more
core +1 more source
Sublinear biLipschitz equivalence and sublinearly Morse boundaries [PDF]
, 2023 A sublinear biLipschitz equivalence (SBE) between metric spaces is a map from one space to another that distorts distances with bounded multiplicative constants and sublinear additive error.
Pallier, Gabriel, Qing, Yulan
core +1 more source
Sublinear circuits for polyhedral sets
, 2021 Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the arithmetic-geometric ...
Naumann, Helen, Theobald, Thorsten
core +1 more source
Sublinear optimization for machine learning [PDF]
Journal of the ACM, 2010 In this article we describe and analyze sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclosing balls. Our algorithms can be extended to some kernelized versions of these problems, such as SVDD, hard margin SVM, andL2-SVM, for which sublinear ...
Kenneth L. Clarkson +2 more
openaire +4 more sources
08341 Abstracts Collection – Sublinear Algorithms [PDF]
, 2008 From August 17 to August 22, 2008, the Dagstuhl Seminar 08341 ``Sublinear Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Muthukrishnan, S. Muthu +3 more
core +1 more source
05291 Abstracts Collection – Sublinear Algorithms [PDF]
, 2006 From 17.07.05 to 22.07.05, the Dagstuhl Seminar 05291 ``Sublinear Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Muthukrishnan, S. Muthu +3 more
core +1 more source
Parameterized streaming : maximal matching and vertex cover [PDF]
, 2014 As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +1 more source