Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800: Dépôts récents
Voici les éléments 241-260 de 1768
-
Un sens logique pour les graphes sémantiques
Communication dans un congrès -
When the Generative Lexicon meets Computational Semantics
Communication dans un congrès -
Les mathématiques de la linguistique computationnelle. Premier volet: la théorie des langages
(Gazette des Mathématiciens. pp. 35--62, 2008-01)Article de revue -
Les mathématiques de la linguistique computationnelle. Second volet: Logique
(Gazette des Mathématiciens. pp. 29--63, 2008-04)Article de revue -
Non-Associative Categorial Grammars and Abstract Categorial Grammars
Communication dans un congrès -
Note de lecture sur Two-Step Approaches to Natural Language Formalisms de Frank Morawietz
(Revue TAL : traitement automatique des langues. vol. 48, n° 3, pp. 227--229, 2009)Article de revue -
[Sans titre]
Communication dans un congrès -
A complexomic study of Escherichia coli using two-dimensional blue native/SDS polyacrylamide gel electrophoresis
(Electrophoresis. vol. 27, pp. 3306--3321, 2007)Article de revue -
ProteomeBinders: planning a European resource of affinity reagents for analysis of the human proteome
(Nature Methods. vol. 4, pp. 13-17, 2007)Article de revue -
The activation of modality in virtual objects assembly
RIVIÈRE, Guillaume; COUTURE, Nadine
; REUTER, Patrick
(Journal on Multimodal User Interfaces. vol. 3, n° 3, pp. 189-196, 2010)Article de revue -
Molecular typing of wine yeast strains Saccharomyces uvarum using microsatellite markers
(Systematic and Applied Microbiology. vol. 30, pp. 75-82, 2007)Article de revue -
Fast Periodic Graph Exploration with Constant Memory
Communication dans un congrès -
Single nucleotide resolution QTL mapping of an enological trait from derived wild Saccharomyces cerevisiae strains
MARULLO, Philippe; YVERT, Gael; BELY, M. ...
(FEMS Yeast Research. vol. in press, pp. 1295-1306, 2007)Article de revue -
Fast Periodic Graph Exploration with Constant Memory
(Journal of Computer and System Sciences. vol. 74, n° 5, pp. 808--822, 2008)Article de revue -
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
(Algorithmic Operations Research. vol. 3, n° 1, pp. 43-50, 2008)Article de revue -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Communication dans un congrès -
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
(Theoretical Computer Science. vol. 285, n° 1, pp. 3--24, 2002-08)Article de revue -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
(Theoretical Computer Science. vol. 326, n° 1--3, pp. 137--153, 2004-10)Article de revue -
On k-Connectivity Problems with Sharpened Triangle Inequality
(Journal of Discrete Algorithms. vol. 6, n° 4, pp. 605--617, 2008)Article de revue