Výsledky vyhľadávania - [INFO.INFO-DS]Computer Science [cs]/Data Structures AND Algorithms [cs.DS]
-
1
Next-generation Allergic Rhinitis and Its Impact on Asthma (ARIA) guidelines for allergic rhinitis based on Grading of Recommendations Assessment, Development and Evaluation (GRADE) and real-world evidence
ISSN: 0091-6749, 1097-6825, 1097-6825Vydavateľské údaje: United States Elsevier Inc 01.01.2020Vydané v Journal of allergy and clinical immunology (01.01.2020)“… The Contre les Maladies Chroniques pour un Vieillissement Actif (MACVIA) algorithm has proposed an allergic rhinitis treatment by a consensus group…”
Získať plný text
Journal Article -
2
Multivehicle Cooperative Local Mapping: A Methodology Based on Occupancy Grid Map Merging
ISSN: 1524-9050, 1558-0016Vydavateľské údaje: New York IEEE 01.10.2014Vydané v IEEE Transactions on Intelligent Transportation Systems (01.10.2014)“… In a general map merging framework, we propose an objective function based on occupancy likelihood and provide some concrete procedures designed in the spirit of genetic algorithm to optimize…”
Získať plný text
Journal Article -
3
Packing Arc-Disjoint Cycles in Tournaments
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: Springer Science and Business Media LLC 04.01.2021Vydané v Algorithmica (04.01.2021)Získať plný text
Journal Article -
4
Algorithmic voice transformations reveal the phonological basis of language-familiarity effects in cross-cultural emotion judgments
ISSN: 1932-6203, 1932-6203Vydavateľské údaje: United States Public Library of Science 03.05.2023Vydané v PloS one (03.05.2023)“…People have a well-described advantage in identifying individuals and emotions in their own culture, a phenomenon also known as the other-race and…”
Získať plný text
Journal Article -
5
Minimally overlapping words for sequence similarity search
ISSN: 1367-4803, 1367-4811Vydavateľské údaje: Oxford University Press (OUP) 26.07.2020Vydané v Bioinformatics (26.07.2020)Získať plný text
Journal Article -
6
Leanness Computation: Small Values and Special Graph Classes
ISSN: 1365-8050, 1462-7264, 1365-8050Vydavateľské údaje: DMTCS 01.01.2024Vydané v Discrete Mathematics and Theoretical Computer Science (01.01.2024)“…Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a…”
Získať plný text
Journal Article -
7
An alternating direction method of multipliers for the eigenvalue complementarity problem
ISSN: 1055-6788, 1029-4937Vydavateľské údaje: Abingdon Taylor & Francis 04.05.2021Vydané v Optimization Methods and Software (04.05.2021)“…) of a Standard Fractional Quadratic Program. The algorithm is also extended for the computation of an SP of a Standard Quadratic Program (StQP…”
Získať plný text
Journal Article -
8
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows
ISSN: 1365-8050, 1462-7264, 1365-8050Vydavateľské údaje: Nancy DMTCS 02.05.2023Vydané v Discrete mathematics and theoretical computer science (02.05.2023)“…An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one…”
Získať plný text
Journal Article -
9
Safe sets, network majority on weighted trees
ISSN: 0028-3045, 1097-0037Vydavateľské údaje: New York Wiley Subscription Services, Inc 01.01.2018Vydané v Networks (01.01.2018)“…Let G=(V,E) be a graph and let w:V→ℝ>0 be a positive weight function on the vertices of G. For every subset X of V, let w(X):=∑v∈Gw(v). A non‐empty subset…”
Získať plný text
Journal Article -
10
Holonomic equations and efficient random generation of binary trees
ISSN: 1365-8050, 1462-7264, 1365-8050Vydavateľské údaje: Nancy DMTCS 01.01.2023Vydané v Discrete mathematics and theoretical computer science (01.01.2023)“… I extend this paradigm to Motzkin trees and Schröder trees and show that despite slight differences my algorithm that generates random…”
Získať plný text
Journal Article -
11
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency
ISSN: 1365-8050, 1462-7264, 1365-8050Vydavateľské údaje: DMTCS 25.01.2021Vydané v Discrete mathematics and theoretical computer science (25.01.2021)“…In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and…”
Získať plný text
Journal Article -
12
Gossiping with interference in radio ring networks
ISSN: 1365-8050Vydavateľské údaje: Centre pour la Communication Scientifique Directe (CCSD) 02.10.2023Vydané v Discrete Mathematics & Theoretical Computer Science (02.10.2023)Získať plný text
Journal Article -
13
Power domination in maximal planar graphs
ISSN: 1365-8050, 1462-7264, 1365-8050Vydavateľské údaje: Nancy DMTCS 13.12.2019Vydané v Discrete Mathematics and Theoretical Computer Science (13.12.2019)“…Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It…”
Získať plný text
Journal Article -
14
Improvement of Silicon Nanotweezers Sensitivity for Mechanical Characterization of Biomolecules Using Closed-Loop Control
ISSN: 1083-4435, 1941-014XVydavateľské údaje: IEEE 01.06.2015Vydané v IEEE/ASME Transactions on Mechatronics (01.06.2015)“…In this paper, we show that closed-loop control can be advantageously used for the characterization of mechanical properties of biomolecules using silicon…”
Získať plný text
Journal Article -
15
Multiscale properties of instantaneous parasympathetic activity in severe congestive heart failure: A survivor vs non-survivor study
ISSN: 1557-170X, 2694-0604, 2694-0604Vydavateľské údaje: United States IEEE 01.07.2017Vydané v Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference (01.07.2017)“… from inhomogeneous point process models. Experimental tests were performed on data gathered from 57 CHF patients, aiming to investigate the automatic recognition accuracy in predicting…”
Získať plný text
Konferenčný príspevok.. Journal Article -
16
Network Majority on Tree Topological Network
ISSN: 1571-0653, 1571-0653Vydavateľské údaje: Elsevier B.V 01.10.2016Vydané v Electronic notes in discrete mathematics (01.10.2016)“…Let G=(V,E) be a graph, and w:V→Q>0 be a positive weight function on the vertices of G. For every subset X of V, let w(X)=∑v∈Gw(v). A non-empty subset S⊂V(G)…”
Získať plný text
Journal Article -
17
The price of connectedness in graph partitioning problems
Vydavateľské údaje: EUCA 01.06.2019Vydané v 2019 18th European Control Conference (ECC) (01.06.2019)“…In this work, we present some results coming from the comparison of two classes of problems of optimal graph partitioning. In the first class of problem,…”
Získať plný text
Konferenčný príspevok.. -
18
Influence of the tie-break rule on the end-vertex problem
ISSN: 1365-8050, 1462-7264, 1365-8050Vydavateľské údaje: Nancy DMTCS 29.07.2014Vydané v Discrete Mathematics and Theoretical Computer Science (29.07.2014)“…End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search…”
Získať plný text
Journal Article -
19
Fine costs for Euclid's algorithm on polynomials and Farey maps
ISSN: 0196-8858, 1090-2074Vydavateľské údaje: Elsevier Inc 01.03.2014Vydané v Advances in applied mathematics (01.03.2014)“…This paper studies digit-cost functions for the Euclid algorithm on polynomials with coefficients in a finite field, in terms of the number of operations performed on the finite field Fq…”
Získať plný text
Journal Article -
20
Proceedings Joint Workshop on Handling IMPlicit and EXplicit knowledge in formal system development (IMPEX) and Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD)
ISSN: 2075-2180Vydavateľské údaje: Open Publishing Association 12.05.2018Vydané v Electronic Proceedings in Theoretical Computer Science (12.05.2018)Získať plný text
Journal Article