DE eng

Search in the Catalogues and Directories

Hits 1 – 14 of 14

1
How to improve robustness in Kohonen maps and display additional information in Factorial Analysis: application to text mining
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
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
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
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 ...
BASE
Show details
7
Graph Analyzer Widget Closer to Agility through Sense-Making
In: DTIC (2014)
BASE
Show details
8
An Annotation Framework for Dense Event Ordering
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.
Abstract: Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is used in a plethora of applications ranging from content-based image retrieval, shape matching, fingerprint recognition, object tracking and phishing web page detection to computing color differences in linguistics and biology. Our starting point is the well-known revised simplex algorithm, which iteratively improves a feasible solution to optimality. The Shortlist Method that we propose substantially reduces the number of candidates inspected for improving the solution, while at the same time balancing the number of pivots required. Tests on simulated benchmarks demonstrate a considerable reduction in computation time for the new method as compared to the usual revised simplex algorithm implemented with state-of-the-art initialization and pivot strategies. As a consequence, the Shortlist Method facilitates the computation of large scale transportation problems in viable time. In addition we describe a novel method for finding an initial feasible solution which we coin Modified Russell's Method. ; Open-Access-Publikationsfonds 2014 ; peerReviewed
Keyword: Algorithms; Computer and information sciences; Consortia; Graphs; Optimization; Simulation and modeling; Solutions; Transportation
URL: http://resolver.sub.uni-goettingen.de/purl?gs-1/10992
https://doi.org/10.1371/journal.pone.0110214
BASE
Hide details
10
Gromov hiperbolicity in graphs
BASE
Show details
11
Supervised and semi-supervised statistical models for word-based sentiment analysis ; Überwachte und halbüberwachte statistische Modelle zur wortbasierten Sentimentanalyse
BASE
Show details
12
Specifying and verifying program transformations with PTRANS
Mansky, William. - 2014
BASE
Show details
13
Construction of an ontology for intelligent Arabic QA systems leveraging the Conceptual Graphs representation
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

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
14
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern