• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year:
    
    • 2014 (14)
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

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 Hits 1 – 14 of 14 1 How to improve robustness in Kohonen maps and display additional information in Factorial Analysis: application to text mining Bourgeois, Nicolas; Cottrell, Marie; Déruelle, Benjamin... In: ISSN: 0925-2312 ; Neurocomputing ; https://hal.archives-ouvertes.fr/hal-01168120 ; Neurocomputing, Elsevier, 2014, 147, pp.120-135. ⟨10.1016/j.neucom.2013.12.057⟩ (2014) BASE Show details 2 Mesurer la similarité structurelle entre réseaux lexicaux Gaume, Bruno; Navarro, Emmanuel; Desalle, Yann... In: TALN-20 2014 ; https://hal.archives-ouvertes.fr/hal-01321990 ; TALN-20 2014, Jul 2014, Marseille, France (2014) BASE Show details 3 Yet Another Ranking Function for Automatic Multiword Term Extraction Lossio-Ventura, Juan Antonio; Jonquet, Clement; Roche, Mathieu... In: 9th International Conference on Natural Language Processing (PolTAL) ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01068556 ; 9th International Conference on Natural Language Processing (PolTAL), Sep 2014, Warsaw, Poland. pp.52-64, ⟨10.1007/978-3-319-10888-9_6⟩ ; http://poltal.ipipan.waw.pl/ (2014) BASE Show details 4 Natural Language Semantics in Biproduct Dagger Categories Preller, Anne In: ISSN: 1570-8683 ; Journal of Applied Logic ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-00860382 ; Journal of Applied Logic, Elsevier, 2014, 12, pp.88-108. ⟨10.1016/j.jal.2013.08.001⟩ (2014) BASE Show details 5 Supervised and semi-supervised statistical models for word-based sentiment analysis ... : Überwachte und halbüberwachte statistische Modelle zur wortbasierten Sentimentanalyse ... Scheible, Christian. - : Universität Stuttgart, 2014 BASE Show details 6 Products And Eccentric Diagraphs ... Medha Itagi Huilgol; Syed Asif Ulla, S.. - : Zenodo, 2014 BASE Show details 7 Graph Analyzer Widget Closer to Agility through Sense-Making Lavigne, Valerie; Lecocq, Regine; Martineau, Etienne... In: DTIC (2014) BASE Show details 8 An Annotation Framework for Dense Event Ordering Cassidy, Taylor; McDowell, Bill; Chambers, Nathanel... In: DTIC (2014) BASE Show details 9 The Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems. Gottschlich, Carsten; Schuhmacher, Dominic. - 2014 BASE Show details 10 Gromov hiperbolicity in graphs Carballosa Torres, Walter. - 2014 BASE Show details 11 Supervised and semi-supervised statistical models for word-based sentiment analysis ; Überwachte und halbüberwachte statistische Modelle zur wortbasierten Sentimentanalyse Scheible, Christian. - 2014 BASE Show details 12 Specifying and verifying program transformations with PTRANS Mansky, William. - 2014 Abstract: Software developers, compiler designers, and formal methods researchers all stand to benefit from improved tools for compiler design and verification. Program correctness for compiled languages depends fundamentally on compiler correctness, and compiler optimizations are usually not formally verified due to the effort involved. This is particularly true for optimizations on parallel programs, which are often more difficult to specify correctly and to verify than their sequential counterparts, especially in the presence of relaxed memory models. In this thesis, we outline a Verification Framework for Optimizations and Program Transformations, designed to facilitate stating and reasoning about compiler optimizations and transformations on parallel programs. Most verified compilation projects focus on a single intermediate language and a small number of input and output languages, later adding new targets as extensions; our framework, on the other hand, is designed with language-independence as a first principle, and we seek to generalize and reuse as much as possible across multiple target languages. Our framework makes use of the novel PTRANS transformation specification language, in which program transformations are expressed as rewrites on control flow graphs with temporal logic side conditions. The syntax of PTRANS allows cleaner, more proof-amenable specification of program optimizations. PTRANS has two sets of semantics: an abstract semantics for verification, and an executable semantics that allows specifications to act as prototypes for the optimizations themselves, so that candidate optimizations can be tested and refined before going on to formally verify them or include them in a compiler. We address the problems of parallelism head-on by developing a generic framework for memory models in VeriF-OPT, and present a method of importing external analyses such as alias analysis to overcome potential limitations of temporal logic. Finally, we demonstrate the use of the framework by prototyping, testing, and verifying the correctness of several variants of redundant store elimination in two markedly different intermediate languages. Keyword: compiler correctness; concurrency; control flow graphs; graph transformation; interactive theorem proving; operational semantics; relaxed memory models; rewriting; Satisfiability Modulo Theories (SMT) solvers; temporal logic URL: http://hdl.handle.net/2142/49385 BASE Hide details 13 Construction of an ontology for intelligent Arabic QA systems leveraging the Conceptual Graphs representation Abouenour, Lahsen; Nasri, Mohamed; Bouzoubaa, Karim. - : IOS Press, 2014 BASE Show details 14 Detección de plagio translingüe utilizando una red semántica multilingüe Franco Salvador, Marc. - : Universitat Politècnica de València, 2014 BASE Show details

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 14 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0