Výsledky vyhledávání - "nonnumerical algorithms and problems"
-
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
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 -
3
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 -
4
Inclusion and Exclusion Criteria for Automating Adherence to Scope of Conference Calls for Papers
Vydáno: IEEE 01.09.2022Vydáno v 2022 Fourth International Conference on Transdisciplinary AI (TransAI) (01.09.2022)“…To conduct a well-designed and reproducible study, researchers must define and adhere to clear inclusion and exclusion criteria for subjects…”
Získat plný text
Konferenční příspěvek -
5
Solving the traffic and flitter challenges with tulip
ISBN: 9781424452835, 142445283XVydáno: IEEE 01.10.2009Vydáno v 2009 IEEE Symposium on Visual Analytics Science and Technology (01.10.2009)“… Our findings suggest that employee 30 may be of interest. In the second part of the paper, we describe our system for finding subgraphs in the social network subject to degree constraints…”
Získat plný text
Konferenční příspěvek -
6
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

