Results 241 to 250 of about 1,003,970 (287)
A Wasserstein-Space-Based Framework for Processing Fiber Orientation Geometry in Diffusion MRI. [PDF]
IEEE Trans Med ImagingNie X, Shi Y.
europepmc +1 more source
LibppRPA: An open-source library for particle-particle random phase approximation. [PDF]
J Chem PhysYu J, Li J, Zhang C, Zhu T, Yang W.
europepmc +1 more source
The AAA Algorithm for Rational Approximation [PDF]
SIAM Journal of Scientific Computing, 2018 We introduce a new algorithm for approximation by rational functions on a real or complex set of points, implementable in 40 lines of Matlab and requiring no user input parameters. Even on a disk or interval the algorithm may outperform existing methods, and on more complicated domains it is especially competitive. The core ideas are (1) representation
Yuji Nakatsukasa +2 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An approximation algorithm for the TSP
Information Processing Letters, 1989For a given complete weighted graph with n nodes, the authors present a heuristic algorithm with running time \(O(n^ 4)\) for the travelling salesman problem. Experimental studies show that the method gives better results in most cases than the well-known Quick method.
Josep M. Basart +1 more
openaire +2 more sources
Approximate Discrete Reconstruction Algorithm [PDF]
Fundamenta Informaticae, 2013 Discrete tomography deals with tomographic reconstruction of greyscale images for which the set of possible grey levels is discrete and small. Here, we develop a discrete approximate reconstruction algorithm. Our algorithm computes an image that has only grey values belonging to a given finite set.
Batenburg, Joost +2 more
openaire +3 more sources
Approximation Algorithms for Scheduling with Reservations
Algorithmica, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +2 more sources
On Approximation Algorithms for # P
SIAM Journal on Computing, 1985It is shown that any function in Valiant's class {\#}P can be approximated to within any constant factor by a function in the class \(\Delta^ P_ 3\) of the polynomial-time hierarchy. A model of random sampling is introduced and discussed in detail. The paper is of interest to specialists in the theory of algorithmic complexity.
openaire +2 more sources
Approximation Algorithms for Treewidth
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Design of Approximation Algorithms
2011Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions.
David P. Williamson, David B. Shmoys
openaire +2 more sources