Výsledky vyhľadávania - [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]~

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 Autor Bousquet, Jean, Schünemann, Holger J., Togias, Akdis, Bachert, Claus, Erhola, Martina, Hellings, Peter W., Klimek, Ludger, Pfaar, Oliver, Wallace, Dana, Ansotegui, Ignacio, Agache, Ioana, Bedbrook, Anna, Bergmann, Karl-Christian, Bewick, Mike, Bonniaud, Philippe, Bosnic-Anticevich, Sinthia, Bossé, Isabelle, Bouchard, Jacques, Boulet, Louis-Philippe, Brozek, Jan, Brusselle, Guy, Calderon, Moises A., Canonica, Walter G., Caraballo, Luis, Cardona, Vicky, Casale, Thomas, Cecchi, Lorenzo, Costa, Elisio M., Cruz, Alvaro A., Czarlewski, Wienczyslawa, D'Amato, Gennaro, Devillier, Philippe, Dykewicz, Mark, Ebisawa, Motohiro, Fauquert, Jean-Louis, Fokkens, Wytske J., Fonseca, Joao A., Fontaine, Jean-François, Gemicioglu, Bilun, van Wijk, Roy Gerth, Haahtela, Tari, Halken, Susanne, Ierodiakonou, Despo, Iinuma, Tomohisa, Ivancevich, Juan-Carlos, Jutel, Marek, Kaidashev, Igor, Khaitov, Musa, Kalayci, Omer, Kleine Tebbe, Jorg, Kowalski, Marek L., Kuna, Piotr, Kvedariene, Violeta, La Grutta, Stefania, Larenas-Linnemann, Désirée, Lau, Susanne, Laune, Daniel, Le, Lan, Lieberman, Philipp, Lodrup Carlsen, Karin C., Lourenço, Olga, Marien, Gert, Carreiro-Martins, Pedro, Melén, Erik, Menditto, Enrica, Neffen, Hugo, Mercier, Gregoire, Mosgues, Ralph, Mullol, Joaquim, Muraro, Antonella, Namazova, Leyla, Novellino, Ettore, O'Hehir, Robyn, Okamoto, Yoshitaka, Ohta, Ken, Park, Hae Sim, Panzner, Petr, Passalacqua, Giovanni, Pham-Thi, Nhan, Price, David, Roche, Nicolas, Rolland, Christine, Rosario, Nelson, Ryan, Dermot, Samolinski, Boleslaw, Sanchez-Borges, Mario, Scadding, Glenis K., Shamji, Mohamed H., Sheikh, Aziz, Bom, Ana-Maria Todo, Toppila-Salmi, Sanna, Tsiligianni, Ioana, Valentin-Rostan, Marylin, Valiulis, Arunas, Valovirta, Erkka, Ventura, Maria-Teresa, Walker, Samantha, Waserman, Susan, Yorgancioglu, Arzu, Zuberbier, Torsten

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

Multivehicle Cooperative Local Mapping: A Methodology Based on Occupancy Grid Map Merging Autor Hao Li, Tsukada, Manabu, Nashashibi, Fawzi, Parent, Michel

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

Packing Arc-Disjoint Cycles in Tournaments Autor Bessy, Stéphane, Bougeret, Marin, Krithika, R., Sahu, Abhishek, Saurabh, Saket, Thiebaut, Jocelyn, Zehavi, Meirav

Získať plný text

Minimally overlapping words for sequence similarity search Autor Martin C. Frith, Gregory Kucherov, Laurent Noé

Získať plný text

Algorithmic voice transformations reveal the phonological basis of language-familiarity effects in cross-cultural emotion judgments Autor Nakai, Tomoya, Rachman, Laura, Arias Sarah, Pablo, Okanoya, Kazuo, Aucouturier, Jean-Julien

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

Leanness Computation: Small Values and Special Graph Classes Autor Coudert, David, Coulomb, Samuel, Ducoffe, Guillaume

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

An alternating direction method of multipliers for the eigenvalue complementarity problem Autor Júdice, Joaquim J., Fukushima, Masao, Iusem, Alfredo, Martinez, J. M., Sessa, Valentina

“…) 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

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows Autor Carvalho, Cláudio, Costa, Jonas, Lopes, Raul, Maia, Ana Karolinna, Nisse, Nicolas, Sales, Cláudia

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

Safe sets, network majority on weighted trees Autor Bapat, Ravindra B., Fujita, Shinya, Legay, Sylvain, Manoussakis, Yannis, Matsui, Yasuko, Sakuma, Tadashi, Tuza, Zsolt

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

Holonomic equations and efficient random generation of binary trees Autor Lescanne, Pierre

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

Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency Autor Bodini, OLivier, Dien, Matthieu, Genitrini, Antoine, Peschanski, Frédéric

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

Gossiping with interference in radio ring networks Autor Bermond, Jean-Claude, Kodate, Takako, Yu, Joseph

Získať plný text

Power domination in maximal planar graphs Autor Dorbec, Paul, González, Antonio, Pennarun, Claire

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

Improvement of Silicon Nanotweezers Sensitivity for Mechanical Characterization of Biomolecules Using Closed-Loop Control Autor Lafitte, Nicolas, Haddab, Yassine, Le Gorrec, Yann, Guillou, Herve, Kumemura, Momoko, Jalabert, Laurent, Collard, Dominique, Fujita, Hiroyuki

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

Multiscale properties of instantaneous parasympathetic activity in severe congestive heart failure: A survivor vs non-survivor study Autor Valenza, G., Wendt, H., Kiyono, K., Hayano, J., Watanabe, E., Yamamoto, Y., Abry, P., Barbieri, R.

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

Network Majority on Tree Topological Network Autor Bapat, Ravindra B., Fujita, Shinya, Legay, Sylvain, Manoussakis, Yannis, Matsui, Yasuko, Sakuma, Tadashi, Tuza, Zsolt

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

Influence of the tie-break rule on the end-vertex problem Autor Charbit, Pierre, Habib, Michel, Mamcarz, Antoine

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

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) Autor Laleau, Régine, Méry, Dominique, Nakajima, Shin, Troubitsyna, Elena

Získať plný text

Fine costs for Euclid's algorithm on polynomials and Farey maps Autor Berthé, Valérie, Nakada, Hitoshi, Natsui, Rie, Vallée, Brigitte

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

The price of connectedness in graph partitioning problems Autor Martin, Nicolas, Frasca, Paolo, Ishizaki, Takayuki, Imura, Jun-Ichi, Canudas-de-Wit, Carlos

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