Výsledky vyhledávání - Analysis of Algorithms AND Problem Complexity—Nonnumerical Algorithms AND Problems

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

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

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

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

Approximate topological matching of quadrilateral meshes Autor Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.

“…We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes…”
Získat plný text

A new approach to rectangle intersections part I Autor Edelsbrunner, Herbert

“…Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data…”
Získat plný text

A new approach to rectangle intersections: Part II Autor Edelsbrunner, Herbert

“…The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions…”
Získat plný text

Counter examples to adjudicating a towers of hanoi contest Autor Er, M.C.

“…This paper points out the inconsistency in the criteria for adjudicating a Towers of Hanoi contest proposed by Wood. Counter examples to some of Wood's claims…”
Získat plný text

Adjudicating a towers of hanoi contest Autor Wood, D.

“… We present linear time and space adjudication algorithms, that is optimal adjudication algorithms…”
Získat plný text

The multiway trees of hanoi Autor Jürgensen, Helmut, Wood, Derick

“…We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality…”
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

Optimal Algorithms for Compact Linear Layouts Autor Sonke, Willem, Verbeek, Kevin, Meulemans, Wouter, Verbeek, Eric, Speckmann, Bettina

“… In this paper we present a novel and versatile algorithm to optimally fold a linear layout of a graph such that it…”
Získat plný text

The Complexity of Coverability in ν-Petri Nets Autor Lazic, Ranko, Schmitz, Sylvain

“… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems…”
Získat plný text

Jewels of stringology: text algorithms Autor Crochemore, Maxime, Rytter, Wojciech

“… and the classification of algorithms according to the measures of complexity considered…”
Získat plný text

Jewels of stringology Autor Crochemore, Maxime, Rytter, Wojciech

“… The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered…”
Získat plný text