نتایج جستجو برای: arbre
تعداد نتایج: 275 فیلتر نتایج به سال:
In subband coding systems of speech, quadrature mirror filter (QMF) banks have been used effectively in a tree-structured form for decomposition and alias-free reconstruction of the speech signal. In the present paper, we derive some new causal and noncausal QMF structures which can reduce group delay. These structures are based on evenas well as odd-length fnite impulse response filters. Zusam...
RÉSUMÉ. La démocratisation et l’évolution des logiciels de traitements de texte ont révolutionné le monde du document. Les auteurs construisent des documents dits structurés c'est-à-dire dont le contenu textuel s’organise autours de balises. Toutefois, la classification traditionnelle de documents n’utilise que le contenu textuel des documents et ignore les informations de structure. Dans ce pa...
Design patterns are well-known couples of problems-solutions for software engineering. By nature, they often lack support from languages and this further complicates the study of their composition in the code. Aspect-oriented languages provide new mechanisms for modularization, which can help to improve design patterns implementation. (Hannemann et al., 2002) is the first extensive study of pat...
We give closed combinatorial product formulas for Kazhdan–Lusztig poynomials and their parabolic analogue of type q in the case of boolean elements, introduced in [M. Marietti, Boolean elements in Kazhdan–Lusztig theory, J. Algebra 295 (2006)], in Coxeter groups whose Coxeter graph is a tree. Such formulas involve Catalan numbers and use a combinatorial interpretation of the Coxeter graph of th...
RÉSUMÉ. Cet article présente un modèle pour la recherche d’information sur des documents XML basée sur la comparaison d’arbres, en utilisant le principe de relaxation de requêtes. Les requêtes et les documents sont représentés par des arbres étendus. Un arbre étendu est construit à partir de l’arbre original, avec la pondération des liens virtuels entre chaque nœud et ses descendants indirects,...
Biophysical quantification of protein interactions is central to unveil the molecular mechanisms cellular processes. Researchers can choose from a wide panel biophysical methods that quantify in different ways, including both classical and more novel techniques. We report outcome an ARBRE-MOBIEU training school held June 2019 Gif-sur-Yvette, France ( https://mosbio.sciencesconf.org/ ). Twenty E...
This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two ...
We study the combinatorics of weighted trees from the point of view of tropical algebraic geometry and tropical linear spaces. The set of dissimilarity vectors of weighted trees is contained in the tropical Grassmannian, so we describe here the tropical linear space of a dissimilarity vector and its associated family of matroids. This gives a family of complete flags of tropical linear spaces, ...
A method to infer X-trees (valued trees having X as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2n-3 distance values between the n elements of X, if they fulfill some explicit conditions. This construction is based on the mapping between X-tree and a weighted generalized 2-tree spann...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید