Výsledky vyhledávání - "Analysis of Algorithms and Problem Complexity"
-
1
Mandatory Critical Points of 2D Uncertain Scalar Fields
ISSN: 0167-7055, 1467-8659Vydáno: Oxford Blackwell Publishing Ltd 01.06.2014Vydáno v Computer graphics forum (01.06.2014)“…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
Journal Article -
2
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams
ISSN: 0167-7055, 1467-8659Vydáno: Oxford Blackwell Publishing Ltd 01.08.2016Vydáno v Computer graphics forum (01.08.2016)“…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
Journal Article -
3
Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions
ISSN: 0167-7055, 1467-8659, 1467-8659Vydáno: Oxford, UK Blackwell Publishing Ltd 01.08.2013Vydáno v Computer graphics forum (01.08.2013)“…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
Journal Article -
4
NP-hardness of deciding convexity of quartic polynomials and related problems
ISSN: 0025-5610, 1436-4646Vydáno: Berlin/Heidelberg Springer-Verlag 01.02.2013Vydáno v Mathematical programming (01.02.2013)“…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
Journal Article -
5
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
ISSN: 1045-9219, 1558-2183Vydáno: New York IEEE 01.12.2008Vydáno v IEEE transactions on parallel and distributed systems (01.12.2008)“… 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
Journal Article -
6
A metrics suite for object oriented design
ISSN: 0098-5589, 1939-3520Vydáno: New York, NY IEEE 01.06.1994Vydáno v IEEE transactions on software engineering (01.06.1994)“…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
Journal Article -
7
Comments on "A metrics suite for object oriented design
ISSN: 0098-5589Vydáno: IEEE 01.03.1995Vydáno v IEEE transactions on software engineering (01.03.1995)“…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
Journal Article -
8
The Complexity of Coverability in ν-Petri Nets
ISSN: 2575-5528Vydáno: ACM 01.07.2016Vydáno v 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (01.07.2016)“… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems…”
Získat plný text
Konferenční příspěvek -
9
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
ISSN: 0025-5610, 1436-4646Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022Vydáno v Mathematical programming (01.07.2022)“… ) subject to a certain cardinality constraint on their intersection X 1 ∩ X 2 . For this problem, Lendl et al…”
Získat plný text
Journal Article