Search Results - "[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 by 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 selection of pharmacotherapy for patients with allergic rhinitis aims to control the disease and depends on many factors. Grading of Recommendations…”
Get full text

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

“…Local mapping is valuable for many real-time applications of intelligent vehicle systems. Multivehicle cooperative local mapping can bring considerable…”
Get full text

Algorithmic voice transformations reveal the phonological basis of language-familiarity effects in cross-cultural emotion judgments by 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…”
Get full text

Leanness Computation: Small Values and Special Graph Classes by 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…”
Get full text

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

“…We introduce an Alternating Direction Method of Multipliers (ADMM) for finding a solution of the nonsymmetric Eigenvalue Complementarity Problem (EiCP). A…”
Get full text

Safe sets, network majority on weighted trees by 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…”
Get full text

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows by 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…”
Get full text

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

Get full text

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

“…Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation…”
Get full text

Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency by 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…”
Get full text

Power domination in maximal planar graphs by 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…”
Get full text

Improvement of Silicon Nanotweezers Sensitivity for Mechanical Characterization of Biomolecules Using Closed-Loop Control by 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…”
Get full text

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

Get full text

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

“…Multifractal analysis of cardiovascular variability series is an effective tool for the characterization of pathological states associated with congestive…”
Get full text

Network Majority on Tree Topological Network by 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)…”
Get full text

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

Get full text

Influence of the tie-break rule on the end-vertex problem by 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…”
Get full text

Fine costs for Euclid's algorithm on polynomials and Farey maps by 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…”
Get full text

The Euclid Algorithm is totally gaussian by Vallée, Brigitte

“…We consider Euclid’s gcd algorithm for two integers $(p, q)$ with $1 \leq p \leq q \leq N$, with the uniform distribution on input pairs. We study the…”
Get full text

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set by Gaspers, Serge, Liedloff, Mathieu

“…Graphs and Algorithms An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in…”
Get full text