Výsledky vyhledávání - analysis of algorithms and problems complexity*

Mandatory Critical Points of 2D Uncertain Scalar Fields Autor Günther, David, Salmon, Joseph, Tierny, Julien

“… The characterization is based on the analysis of the support of the probability density functions (PDF) of the input data. Given two scalar fields representing reliable estimations…”
Získat plný text

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions Autor Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension…”
Získat plný text

Energy-aware lot sizing problem: Complexity analysis and exact algorithms Autor Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper…”
Získat plný text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams Autor Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
Získat plný text

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems Autor Bergou, El Houcine, Diouane, Youssef, Kungurtsev, Vyacheslav

“…The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems…”
Získat plný text

New Bounds on the Size of Optimal Meshes Autor Sheehy, Donald R.

“…The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of…”
Získat plný text

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis Autor LaRusic, John, Punnen, Abraham P.

“… Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis. A polynomial time ⌈n/2…”
Získat plný text

Description and Solution of an Unreported Intrinsic Bias in Photon Mapping Density Estimation with Constant Kernel Autor García, R., Ureña, C., Sbert, M.

“…This paper presents an analysis of the irradiance estimator often used in photon mapping algorithms and concludes that the classical approach with a constant kernel overestimates the correct value…”
Získat plný text

Nearly Optimal Communication and Query Complexity of Bipartite Matching Autor Blikstad, Joakim, Van Den Brand, Jan, Efron, Yuval, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We settle the complexities of the maximum-cardinality bipartite matching problem (BMM…”
Získat plný text

Improved grid map layout by point set matching Autor Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“…Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered…”
Získat plný text

Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs Autor Yeh, Hao-Ping, Lu, Wei, Chen, Li-Hsuan, Hung, Ling-Ju, Klasing, Ralf, Hsieh, Sun-Yuan

“… minimized. In this paper, we prove that the Starp-Hub Routing Cost Problem is NP-hard. A 3-approximation algorithm running in time O(n2…”
Získat plný text

Biased initialization in random walk algorithms for k -SAT: a generalization of Schöning's method Autor Ghosh, Subhas Kumar, Vittamsetti, Vijay Monic

Získat plný text

NP-hardness of deciding convexity of quartic polynomials and related problems Autor Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“…) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials…”
Získat plný text

(Re)packing Equal Disks into Rectangle Autor Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav

“…The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem…”
Získat plný text

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG Autor Caceres, Manuel, Mumey, Brendan, Husic, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.

“…A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of…”
Získat plný text

Cut Query Algorithms with Star Contraction Autor Apers, Simon, Efron, Yuval, Gawrychowski, Pawel, Lee, Troy, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show…”
Získat plný text

Efficient assembly consensus algorithms for divergent contig sets Autor Chateau, Annie, Davot, Tom, Lafond, Manuel

“… This amounts to orienting and ordering sets of contigs, which can be viewed as an optimization problem where the aim is to find an alignment of two fragmented strings that maximizes an arbitrary…”
Získat plný text

Beyond the Limits of DPA: Combined Side-Channel Collision Attacks Autor Bogdanov, A., Kizhvatov, I.

“… embedded implementations of cryptographic algorithms. To address it, this work proposes a novel framework enhancing side-channel collision attacks with divide-and-conquer attacks such as differential power analysis (DPA…”
Získat plný text

Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations Autor Ke Yi, Feifei Li, Kollios, G., Srivastava, D.

“… In the multialternative case, we introduce the first-known polynomial algorithms, while the current best algorithms have exponential complexity in both time and space…”
Získat plný text

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks Autor Wang, Yu, Wang, Weizhao, Li, Xiang-Yang, Song, Wen-Zhan

“…We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link…”
Získat plný text