Výsledky vyhledávání - "Analysis of Algorithms and Problem Complexity"

Mandatory Critical Points of 2D Uncertain Scalar Fields Autor 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…”
Získat plný text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams Autor 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…”
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. This…”
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.

“…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…”
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

“… Using a mathematical formulation, we develop interference aware joint routing and TDMA link schedulings that optimize the networking throughput subject to various constraints…”
Získat plný text

A metrics suite for object oriented design Autor Chidamber, S.R., Kemerer, C.F.

“…Given the central role that software development plays in the delivery and application of information technology, managers are increasingly focusing on process…”
Získat plný text

Comments on "A metrics suite for object oriented design Autor Churcher, N.I., Shepperd, M.J., Chidamber, S., Kemerer, C.F.

“…A suite of object oriented software metrics has recently been proposed by S.R. Chidamber and C.F. Kemerer (see ibid., vol. 20, p. 476-94, 1994). While the…”
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

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications Autor Iwamasa, Yuni, Takazawa, Kenjiro

“… ) subject to a certain cardinality constraint on their intersection X 1 ∩ X 2 . For this problem, Lendl et al…”
Získat plný text