Suchergebnisse - "Nonnumerical Algorithms and Problems"

Mandatory Critical Points of 2D Uncertain Scalar Fields von 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 …”
Volltext

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions von 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 …”
Volltext

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

Inclusion and Exclusion Criteria for Automating Adherence to Scope of Conference Calls for Papers von Craig, Adam, Taswell, Carl

“… To conduct a well-designed and reproducible study, researchers must define and adhere to clear inclusion and exclusion criteria for subjects …”
Volltext

Solving the traffic and flitter challenges with tulip von Simonetto, P., Koenig, P.-Y., Zaidi, F., Archambault, D., Gilbert, F., Trung-Tien Phan-Quang, Mathiaut, M., Lambert, A., Dubois, J., Sicre, R., Brulin, M., Vieux, R., Melancon, G.

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

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

“… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems …”
Volltext