{2k}\\) -freeness: first, we use the new connection to extremal combinatorics to show that the current lower bound of \\({ilde{\\varOmega }}(\\sqrt{n})\\) rounds for 6-cycle freeness cannot be improved using pa
Algorithmic Complexity Algorithms Computational Complexity Genome assembly algorithms Topological Groups and Lie Groups Group Theory and Generalizations Notes For the design of subquadratic deterministic algorithms for group theoretic problems where the groups are given by their Cayley table it is standa...
Nylon monofilament and braided silk suture (Teleflex Medical, Wayne, PA), and elastane yarn (Madeira, Freiburg, Germany) were used, respectively, to mimic collagen and elastin fibers (Fig. 3j,k). Mechanical Testing and Digital Image Correlation Woven textile prototype swatches were tested ...
Various techniques have been investigated for channel selection in the processing of EEG signals. This paper presents a survey for the recent developments in this field. Several flowcharts and tabular forms are presented to enable the reader to explore the different channel selection algorithms, to d...
1(a), on the anterior aspect (corresponds to side of bone with ROI indicated by dashed square 3. Used with permission after37. (g) Schematic representation of fabric complexity showing weave of spatially and temporally varying threads, where the color scale depicts either local strains ...
In Section 4, we give two algorithms for computing the Shapley value of cooperative games on implicational systems and discuss their complexity. In Section 5, we study the case where the lattice of feasible coalitions is isomorphic to a product of chains. We then show that when the chains ...
Varian linear accelerator DMX, TPS Eclipse (version 10.33) is used and absolute dosimetry and relative dosimetry system (PTW, Freiburg, Germany) and 2D array were also used. The Calculation of Analytical Anisotropic Algorithm (AAA) is more accurate than the Pencil beam Algorithm (PBC) in ...
As one main end-result of this derandomized hitting set, we get a deterministic distributed algorithm with round complexity 2O( √ log n·log log n) for computing a (2k 1)-spanner of size (n1+1/k). This improves considerably on a recent algorithm of Grossman and Parter [DISC'17] ...
Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany Moritz Diehl Corresponding author Correspondence toMoritz Diehl. Editor information Editors and Affiliations Electrical and Computer Engineering, Boston University, Boston, Massachusetts, USA ...
Editors and Affiliations Department of Computer Science, Albert-Ludwigs University Freiburg, Georges Köhler-Allee, Geb. 079, 79110, Freiburg, Germany Luc De Raedt Inst.of Information and Computing Sciences Dept. of Mathematics and Computer Science, University of Utrecht, Padualaan 14, de Uithof,...