-
461
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
Published 2015“…We obtain improved approximation algorithms for VCHC on multigraphs and hypergraphs. …”
Get full text
Get full text
Get full text
Article -
462
Delta DLP 3-D printing of large models
Published 2020“…We propose a simple yet efficient approximation algorithm to solve this problem. The key idea is to segment a polygonal domain using its medial axis and afterward merge small parts in the segmentation. …”
Get full text
Journal Article -
463
Distributed verification and hardness of distributed approximation
Published 2013“…Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm for any approximation factor. …”
Get full text
Get full text
Journal Article -
464
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation
Published 2021-05-01“…On the positive side, we present a polynomial-time approximation algorithm for the problem.…”
Get full text
Article -
465
Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity
Published 2023-06-01“…For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. …”
Get full text
Article -
466
New results on spread of influence in social networks
Published 2015“…Nevertheless, I present an approximation algorithm that can provably guarantee the cost of the solution to be within a multiplicative and additive factor of an optimal set. …”
Get full text
Thesis -
467
Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game
Published 2020-12-01“…On the positive side, we devise a <i>strongly</i> polynomial-time <inline-formula><math display="inline"><semantics><mrow><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></semantics></math></inline-formula>-approximation algorithm, which favorably compares against the classic approach based on a <i>single-price</i> algorithm. …”
Get full text
Article -
468
-
469
Design of high speed high resolution ADC with innovative architecture and circuits
Published 2016“…In addition, the conventional shift register based successive approximation algorithm has been optimized, which reduces the settling time for the DAC array. …”
Get full text
Thesis -
470
No Fine-Tuning, No Cry: Robust SVD for Compressing Deep Networks
Published 2021-08-01“…Our main technical result is a practical and provable approximation algorithm to compute it for any <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>p</mi><mo>≥</mo><mn>1</mn></mrow></semantics></math></inline-formula>, based on modern techniques in computational geometry. …”
Get full text
Article -
471
-
472
New sublinear methods in the struggle against classical problems
Published 2011Get full text
Thesis -
473
Automated Flax Seeds Testing Methods Based on Machine Vision
Published 2024-01-01“…Based on the contour approximation algorithm, contour corner detection was performed to obtain the coordinates of each corner. …”
Get full text
Article -
474
-
475
-
476
A Novel Mathematical Model for Radio Mean Square Labeling Problem
Published 2022-01-01“…A comparison between the proposed approximate algorithm and the proposed mathematical model is given. …”
Get full text
Article -
477
Approximate Techniques in Solving Optimal Camera Placement Problems
Published 2013-11-01“…There exists a myriad of approximate algorithms for BIP problems, but their applications, efficiency, and scalability in solving camera placement are poorly understood. …”
Get full text
Article -
478
Learning to Trade with Insider Information
Published 2005“…I analyze this approximate algorithm fromthe perspective of reinforcement learning and discuss the importanceof domain knowledge in designing a successful learning algorithm.…”
Get full text
-
479
Progress in combinatorial optimization /
Published 2012“…In the past years, new results and major advances have been seen in many areas including computational complexity, approximation algorithms, cutting-plane based methods and submodularity function minimization. …”
-
480
Curve Reconstruction By Metaheuristics Algorithms On Cubic Rational Bézier Function
Published 2019“…The optimisation technique consists of exact algorithm, and approximate algorithm. The approximate algorithm is a good technique to be highlighted since it is a feasible way to develop an easier, more convenient curve fitting method, that will save great computation, solve a large scale problem and produce a better quality end result. …”
Get full text
Thesis