LORIA

Vandœuvre-lès-Nancy, France
Vandœuvre-lès-Nancy, France
SEARCH FILTERS
Time filter
Source Type

Lubicz D.,Directorate General of Armaments | Lubicz D.,University of Rennes 1 | Robert D.,LORIA
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's algorithm, is its generality since it extends to all abelian varieties the classical Weil and Tate pairing formulas. In the case of dimension 1 and 2 abelian varieties our algorithms lead to implementations which are efficient and naturally deterministic. We also introduce symmetric Weil and Tate pairings on Kummer varieties and explain how to compute them efficiently. We exhibit a nice algorithmic compatibility between some algebraic groups quotiented by the action of the automorphism -1, where the Z-action can be computed efficiently with a Montgomery ladder type algorithm. © 2010 Springer-Verlag Berlin Heidelberg.


Jeandel E.,LORIA | Vanier P.,University Paris Est Creteil
Journal of Computer and System Sciences | Year: 2015

Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts in dimensions d>1 for subshifts of finite type and sofic shifts and in dimensions d≥1 for effective shifts. In particular, we prove that the conjugacy, factorization and embedding problems are Σ30-complete for sofic and effective subshifts and that they are Σ10-complete for SFTs, except for factorization which is also Σ30-complete.


Kacem A.,UTIC | Saidani A.,UTIC | Belaid A.,LORIA
Proceedings of the International Conference on Document Analysis and Recognition, ICDAR | Year: 2011

In this paper we present a student information sheet reading system. Relevant algorithm is proposed to locate and label handwritten answer field. As information sheets can be filled in Arabic and/or in French, automating the script language differentiation is a pre-recognition required in the proposed system. We have developed a robust and fast field classification and script language identification method, based on a decision tree, to make these processing practical for sheet recognition. To this end, the system uses several novel features (loops, descenders, diacritics) and analyses the lower profile of script. The classification rates are 92.5% for numeric fields, 94.34% for Arabic scripts and 94.66% for French scripts. Experimental results, carried on 80 sheets, show our system provides an effective way to convert printed sheets into computerized format or collect information for database from printed sheets. © 2011 IEEE.


Bisson G.,LORIA | Bisson G.,TU Eindhoven
Journal of Mathematical Cryptology | Year: 2012

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann hypothesis. Additionally, we improve the asymptotic complexity of previously known, heuristic, subexponential methods by describing a faster isogeny-computing routine. © de Gruyter 2011.


The invention provides a method for the treatment and prevention of food allergy, and food anaphylaxis disease and conditions ameliorated by histamine management in a subject, comprising administering to the subject an effective amount of a histidine decarboxylase inhibitor sole or with anti-H1 drug or with an anti-H2 drug, or with LRA (Leucotriene Receptor Antagonist).


The invention provides a method for the treatment of COPD and/or gastrointestinal disease conditions ameliorated by histamine management in a subject, comprising administering to the subject an effective amount of a histidine decarboxylase inhibitor.


Ghanmi N.,LORIA | Ghanmi N.,eNovalys | Belaid A.,University of Lorraine
Proceedings of International Conference on Frontiers in Handwriting Recognition, ICFHR | Year: 2014

In this paper, we present a new approach using conditional random fields (CRFs) to localize tabular components in an unconstrained handwritten compound document. Given a line-segmented document, the extraction of table is considered as a labeling task that consists in assigning a label to each line: Table Row label for a line which belongs to a table and Line Text label for a line which belongs to a text block. To perform the labeling task, we use a CRF model to combine two classifiers: a local classifier which assigns a label to the line based on local features and a contextual classifier which uses features taking into account the neighborhood. The CRF model gives the global conditional probability of a given labeling of the line considering the outputs of the two classifiers. A set of chemistry documents is used for the evaluation of this approach. The obtained results are around 88% of table lines correctly detected. © 2014 IEEE.


Lamirel J.-C.,LORIA
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2016

This paper deals with a major challenge in clustering that is optimal model selection. It presents new efficient clustering quality indexes relying on feature maximization, which is an alternative measure to usual distributional measures relying on entropy or on Chi-square metric or vector-based measures such as Euclidean distance or correlation distance. Experiments compare the behavior of these new indexes with usual cluster quality indexes based on Euclidean distance on different kinds of test datasets for which ground truth is available. This comparison clearly highlights altogether the superior accuracy and stability of the new method, its efficiency from low to high dimensional range and its tolerance to noise. © Springer International Publishing Switzerland 2016.


Napoli A.,LORIA
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

In this talk, we discuss and illustrate links existing between knowledge discovery in databases (KDD), knowledge representation and reasoning (KRR), and case-based reasoning (CBR). KDD techniques especially based on Formal Concept Analysis (FCA) are well formalized and allow the design of concept lattices from binary and complex data. These concept lattices provide a realistic basis for knowledge base organization and ontology engineering. More generally, they can be used for representing knowledge and reasoning in knowledge systems and CBR systems as well. © 2010 Springer-Verlag.


Kaytoue M.,LORIA
Studies in Classification, Data Analysis, and Knowledge Organization | Year: 2011

Gene expression matrices are numerical tables that describe the level of expression of genes in different situations, characterizing their behaviour. Biologists are interested in identifying groups of genes presenting similar quantitative variations of expression. This paper presents new syntactic constraints for itemset mining in particular Boolean gene expression matrices. A two dimensional gene expression profile representation is introduced and adapted to itemset mining allowing one to control gene expression. Syntactic constraints are used to discover itemsets with significant expression variations from a large collection of gene expression profiles. © Springer-Verlag Berlin Heidelberg 2011.

Loading LORIA collaborators
Loading LORIA collaborators