Results 31 to 40 of about 6,450,253 (299)
Coresets for the Average Case Error for Finite Query Sets
Sensors, 2021 Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded.
Alaa Maalouf +3 more
doaj +1 more source
Practical Sketching Algorithms for Low-Rank Matrix Approximation [PDF]
SIAM Journal on Matrix Analysis and Applications, 2016 This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image, or sketch, of the matrix.
J. Tropp +3 more
semanticscholar +1 more source
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
Algorithms, 2019 For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj +1 more source
Algorithms For Positive Polynomial Approximation [PDF]
SIAM Journal on Numerical Analysis, 2019 Summary: We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions. Our method is based on the special representations
Charles, Frédérique +2 more
openaire +2 more sources
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2012 We consider a repetitive routing problem of a single grasp-and-delivery robot used on a printed circuit board (PCB) assembly line. The robot arranges n identical pins from their current configuration to the next required one by transferring at most one ...
Aleksandar SHURBEVSKI +2 more
doaj +1 more source
A simple greedy approximation algorithm for the unit disk cover problem [PDF]
AUT Journal of Mathematics and Computing, 2020 Given a set $\mathcal P$ of $n$ points in the plane, the unit disk cover problem, which is known as an NP-hard problem, seeks to find the minimum number of unit disks that can cover all points of $\mathcal P$. We present a new $4$-approximation algorithm
Mahdi Imanparast, Seyed Naser Hashemi
doaj +1 more source
Randomized numerical linear algebra: Foundations and algorithms [PDF]
Acta Numerica, 2020 This survey describes probabilistic algorithms for linear algebraic computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problems.
P. Martinsson, J. Tropp
semanticscholar +1 more source
Approximation Algorithms for Aligning Points [PDF]
Algorithmica, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Cabello, Marc J. van Kreveld
openaire +4 more sources
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights
Algorithms, 2016 In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest.
Daniel R. Page, Roberto Solis-Oba
doaj +1 more source
Distributed approximation algorithms for weighted shortest paths [PDF]
Symposium on the Theory of Computing, 2014 A distributed network is modeled by a graph having n nodes (processors) and diameter D. We study the time complexity of approximating weighted (undirected) shortest paths on distributed networks with a O (log n) bandwidth restriction on edges (the ...
Danupon Nanongkai
semanticscholar +1 more source