Sciweavers

945 search results - page 34 / 189
» On the robustness of primitive words
Sort
View
LATA
2009
Springer
16 years 26 days ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana
DLT
2007
15 years 7 months ago
Duplication Roots
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
Peter Leupold
NLDB
2004
Springer
15 years 11 months ago
Concept Indexing for Automated Text Categorization
In this paper we explore the potential of concept indexing with WordNet synsets for Text Categorization, in comparison with the traditional bag of words text representation model. ...
José María Gómez Hidalgo, Jos...
188
Voted
AND
2010
15 years 4 months ago
Reshaping automatic speech transcripts for robust high-level spoken document analysis
High-level spoken document analysis is required in many applications seeking access to the semantic content of audio data, such as information retrieval, machine translation or au...
Julien Fayolle, Fabienne Moreau, Christian Raymond...
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...