Sciweavers

284 search results - page 36 / 57
» Efficient Parsing for French
Sort
View
ASIACRYPT
2001
Springer
14 years 8 days ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
NAACL
2007
13 years 10 months ago
RH: A Retro-Hybrid Parser
Contemporary parser research is, to a large extent, focused on statistical parsers and deep-unification-based parsers. This paper describes an alternative, hybrid architecture in ...
Paula Newman
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 27 days ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
ACL
2006
13 years 10 months ago
Multilingual Legal Terminology on the Jibiki Platform: The LexALP Project
This paper presents the particular use of "Jibiki" (Papillon's web server development platform) for the LexALP1 project. LexALP's goal is to harmonise the term...
Gilles Sérasset, Francis Brunet-Manquat, El...
ICML
2007
IEEE
14 years 9 months ago
Incremental Bayesian networks for structure prediction
We propose a class of graphical models appropriate for structure prediction problems where the model structure is a function of the output structure. Incremental Sigmoid Belief Ne...
Ivan Titov, James Henderson