Search Results - "Analysis of Algorithms and Problem Complexity"

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

“…This paper introduces a novel, non‐local characterization of critical points and their global relation in 2D uncertain scalar fields. The characterization is…”
Get full text

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

“…Let X = {f1, …, fn} be a set of scalar functions of the form fi : ℝ2 → ℝ which satisfy some natural properties. We describe a subdivision algorithm for…”
Get full text

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions by 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. This…”
Get full text

New Bounds on the Size of Optimal Meshes by 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…”
Get full text

Description and Solution of an Unreported Intrinsic Bias in Photon Mapping Density Estimation with Constant Kernel by 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…”
Get full text

Improved grid map layout by point set matching by 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…”
Get full text

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

“…Given a metric graph G=(V,E,w), a specific vertex c∈V, and an integer p, let T be a depth-2 spanning tree of G rooted at c such that c is adjacent to p…”
Get full text

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

Get full text

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

“…We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of…”
Get full text

(Re)packing Equal Disks into Rectangle by 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. (By a packing here we mean an arrangement of disks in a…”
Get full text

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG by 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 them. Standard formulations of such problems…”
Get full text

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

“…We settle the complexities of the maximum-cardinality bipartite matching problem (BMM) up to polylogarithmic factors in five models of computation: the…”
Get full text

Cut Query Algorithms with Star Contraction by 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 that (i) there is a bounded-error randomized algorithm…”
Get full text

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

“…Assembly is a fundamental task in genome sequencing, and many assemblers have been made available in the last decade. Because of the wide range of possible…”
Get full text

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

“…The problem of extracting the highest possible amount of key-related information using the lowest possible number of measurements is one of the central…”
Get full text

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks by 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…”
Get full text

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

“…This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An…”
Get full text

Selected Papers of the First International Conference on Algorithms for Computational Biology (AlCoB 2014) by Dediu, Adrian-Horia, Martin-Vide, Carlos

“…This special section of the IEEE/ACM Transactions on Computational Biology and Bioinformatics contains extended versions of the best papers presented at the…”
Get full text

An AND-OR-Tree Connected to Leaves via Communication Channels by Suzuki, Toshio

“…We introduce a successor model of an AND-OR tree. Leaves are connected to internal nodes via communication channels that possibly have high probability of…”
Get full text

The P versus NP–complete dichotomy of some challenging problems in graph theory by de Figueiredo, Celina M.H.

“…The Clay Mathematics Institute has selected seven Millennium Problems to motivate research on important classic questions that have resisted solution over the…”
Get full text