Home Catalogue search

eng

Refine your search:
- Keyword
- Creator / Publisher:
- Year
- Medium
- Type
- BLLDB-Access:
  - free (26)
  - subject to license (0)

Search in the Catalogues and Directories






	Sort by
Simple Search

Page: 1 2

Hits 1 – 20 of 26

1	Трансформации при переводе научной аннотации на английский язык ; Using Transformations for Translating Scientific Abstracts into English
	Чернышев, А. В.. - : ООО «Издательство УМЦ УПИ», 2019
	BASE
	Show details

2	Mahonian STAT on words
	Kitaev, Sergey; Vajnovszki, Vincent
	In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01418254 ; Information Processing Letters, Elsevier, 2016, 116 (2), pp.157 - 162. ⟨10.1016/j.ipl.2015.09.006⟩ ; http://www.sciencedirect.com/science/article/pii/S0020019015001611 (2016)
	Abstract: International audience ; In 2000, Babson and Steingrímsson introduced the notion of what is now known as a permutation vincular pattern, and based on it they re-defined known Mahonian statistics and introduced new ones, proving or conjecturing their Mahonity. These conjectures were proved by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006. In 2010, Burstein refined some of these results by giving a bijection between permutations with a fixed value for the major index and those with the same value for STAT , where STAT is one of the statistics defined and proved to be Mahonian in the 2000 Babson and Steingrímsson's paper. Several other statistics are preserved as well by Burstein's bijection. At the Formal Power Series and Algebraic Combinatorics Conference (FPSAC) in 2010, Burstein asked whether his bijection has other interesting properties. In this paper, we not only show that Burstein's bijection preserves the Eulerian statistic ides , but also use this fact, along with the bijection itself, to prove Mahonity of the statistic STAT on words we introduce in this paper. The words statistic STAT introduced by us here addresses a natural question on existence of a Mahonian words analogue of STAT on permutations. While proving Mahonity of our STAT on words, we prove a more general joint equidistribution result involving two six-tuples of statistics on (dense) words, where Burstein's bijection plays an important role.
	Keyword: [INFO]Computer Science [cs]; Bijections; Combinatorial problems; Combinatorics; Equidistribution; Mathematical Analysis; Mathematical proofs; Pattern; Permutations; Statistic; Words and Permutations
	URL: https://doi.org/10.1016/j.ipl.2015.09.006 https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01418254
	BASE
	Hide details

3	A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
	Clément, Julien; Nguyen Thi, Thu Hien; Vallée, Brigitte
	In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) ; https://hal.archives-ouvertes.fr/hal-00913309 ; 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013, Kiel, Germany. pp.598--609, ⟨10.4230/LIPIcs.STACS.2013.598⟩ (2013)
	BASE
	Show details

4	On the combinatorics of suffix arrays
	Kucherov, Gregory; Tóthmérész, Lilla; Vialette, Stéphane
	In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal.archives-ouvertes.fr/hal-00864634 ; Information Processing Letters, Elsevier, 2013, 113 (22-24), pp.915-920. ⟨10.1016/j.ipl.2013.09.009⟩ (2013)
	BASE
	Show details

5	A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
	Nguyen Thi, Thu Hien. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. : LIPIcs - Leibniz International Proceedings in Informatics. 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013
	BASE
	Show details

6	Compressed Representations of Permutations, and Applications
	Barbay, Jeremy; Navarro, Gonzalo. - : LIPIcs - Leibniz International Proceedings in Informatics. 26th International Symposium on Theoretical Aspects of Computer Science, 2009
	BASE
	Show details

7	Idioms in example-based machine translation
	Anastasiou, Dimitra. - 2008
	BASE
	Show details

8	ADAPTIVE REORDERING OF OBSERVATION SPACE TO IMPROVE PATTERN RECOGNITION
	Juliusz L. Kulikowski
	In: http://www.task.gda.pl/files/quart/TQ2007/01-02/tq111m-e.pdf (2007)
	BASE
	Show details

9	Words Reordering Based On Statistical Language Model ...
	Athanaselis, Theologos; Bakamidis, Stelios; Dologlou, Ioannis. - : Zenodo, 2007
	BASE
	Show details

10	Words Reordering Based On Statistical Language Model ...
	Athanaselis, Theologos; Bakamidis, Stelios; Dologlou, Ioannis. - : Zenodo, 2007
	BASE
	Show details

11	N-Grams: A Tool For Repairing Word Order Errors In Ill-Formed Texts ...
	Athanaselis, Theologos; Bakamidis, Stelios; Dologlou, Ioannis. - : Zenodo, 2007
	BASE
	Show details

12	N-Grams: A Tool For Repairing Word Order Errors In Ill-Formed Texts ...
	Athanaselis, Theologos; Bakamidis, Stelios; Dologlou, Ioannis. - : Zenodo, 2007
	BASE
	Show details

13	A Preliminary Statistical Investigation into the Impace of an N-Gram Analysis Approach Based on World Syntactic Categories Toward Text Author Classification
	Diab, Mona; Schuster, John; Bock, Peter
	In: DTIC (2000)
	BASE
	Show details

14	Uses of the Diagnostic Rhyme Test (English Version) for Predicting the Effects of Communicators' Linguistic Backgrounds on Voice Communications in English: An Exploratory Study
	Voiers, William D.
	In: DTIC (2000)
	BASE
	Show details

15	Ranking and Unranking of Lexicographically Ordered Words: An Average-Case Analysis
	Jens Liebehenschel
	In: http://boa.sads.informatik.uni-frankfurt.de:8000/jens/rank.ps (1997)
	BASE
	Show details

16	Labelled Formal Languages and Their Uses.
	Greene, Daniel H.
	In: DTIC AND NTIS (1991)
	BASE
	Show details

17	(-l 1992 Gordon and Brcach Scicncc Publishers S.A. Printed in the United Kinedom ON RANDOM AND ADAPTIVE PARALLEL GENERATION OF COMBINATORIAL OBJECTS
	Ivan Stojmenovic
	In: http://www.site.uottawa.ca/~ivan/F22-random-parallel.PDF (1990)
	BASE
	Show details

18	A Government-Binding Based Parser for Warlpiri, a Free-Word Order Language.
	Kashket, Michael B
	In: DTIC AND NTIS (1987)
	BASE
	Show details

19	Stack permutations and an order relation for binary trees
	Hille, Reinhold Friedrich
	In: Department of Computing Science Working Paper Series (1982)
	BASE
	Show details

20	A Decision Problem of Finite State Probabilistic Automata.
	Chen,K. A.; Hu,Ming K.
	In: DTIC AND NTIS (1971)
	BASE
	Show details

Page: 1 2

© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern