Home
Catalogue search
Refine your search:
Keyword
Creator / Publisher:
The Pennsylvania State University CiteSeerX Archives (7)
Athanaselis, Theologos (4)
Bakamidis, Stelios (4)
Dologlou, Ioannis (4)
Andrea Sgarro (2)
Liviu P. Dinu (2)
Luca Bortolussi (2)
Mamouras, Konstantinos (2)
Nguyen Thi, Thu Hien (2)
Trieste Italia (2)
more
Year:
2019 (1)
2016 (1)
2013 (3)
2009 (1)
2008 (1)
2007 (5)
2000 (2)
1997 (1)
1991 (1)
1990 (1)
more
Medium
Type:
Article (26)
BLLDB-Access:
free (26)
subject to license (0)
Search in the Catalogues and Directories
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
Sort by
creator [A → Z]
'
creator [Z → A]
'
publishing year ↑ (asc)
'
publishing year ↓ (desc)
'
title [A → Z]
'
title [Z → A]
'
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)
BASE
Show 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)
Abstract:
This research augments formal languages with the machinery necessary to describe labelled combinatorial objects such as trees, permutations, and networks. The most attractive feature of this method of describing combinatorial objects is the direct translation to generating functions, treating the grammar of an ordinary formal language as a set of equations and then solving these equations yields an enumerating generating function. This is still true of labelled formal languages although the equations are usually differential rather than rational or algebraic. There are two promising applications for labelled formal languages. In the analysis of algorithms one often identifies combinatorial quantities that can be described with labelled formal languages and, using the translation mentioned about, these quantities can be easily computed. The other application uses labelled formal languages to control a general-purpose system for the ranking, sequencing, and selection of combinatorial objects. Both of these applications demonstrate the value of labelled formal languages as a descriptive and analytic tool.
Keyword:
*ALGORITHMS
;
*PROGRAMMING LANGUAGES
;
COMBINATORIAL ANALYSIS
;
COMPUTER LOGIC
;
COMPUTER PROGRAMMING
;
Computer Programming and Software
;
CONTEXT SENSITIVE GRAMMARS
;
FIELDS(COMPUTER PROGRAMS)
;
PERMUTATIONS
;
THESES
URL:
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA328418
http://www.dtic.mil/docs/citations/ADA328418
BASE
Hide 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
Mobile view
All
Catalogues
UB Frankfurt Linguistik
0
IDS Mannheim
0
OLC Linguistik
0
UB Frankfurt Retrokatalog
0
DNB Subject Category Language
0
Institut für Empirische Sprachwissenschaft
0
Leibniz-Centre General Linguistics (ZAS)
0
Bibliographies
BLLDB
0
BDSL
0
IDS Bibliografie zur deutschen Grammatik
0
IDS Bibliografie zur Gesprächsforschung
0
IDS Konnektoren im Deutschen
0
IDS Präpositionen im Deutschen
0
IDS OBELEX meta
0
MPI-SHH Linguistics Collection
0
MPI for Psycholinguistics
0
Linked Open Data catalogues
Annohub
0
Online resources
Link directory
0
Journal directory
0
Database directory
0
Dictionary directory
0
Open access documents
BASE
26
Linguistik-Repository
0
IDS Publikationsserver
0
Online dissertations
0
Language Description Heritage
0
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern