Sciweavers

3818 search results - page 64 / 764
» Word Problems on Compressed Words
Sort
View
WEWORC
2007
148views Cryptology» more  WEWORC 2007»
15 years 5 months ago
Preimages for Reduced-Round Tiger
The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on finding collisions. In this paper we describe a preimage attack on the compression function ...
Sebastiaan Indesteege, Bart Preneel
IPL
2008
65views more  IPL 2008»
15 years 4 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
INTERSPEECH
2010
14 years 11 months ago
Prominence detection in Swedish using syllable correlates
This paper presents an approach to estimating word level prominence in Swedish using syllable level features. The paper discusses the mismatch problem of annotations between word ...
Samer Al Moubayed, Jonas Beskow
NLDB
2007
Springer
15 years 10 months ago
Electronic Dictionaries and Transducers for Automatic Processing of the Albanian Language
We intend on developing electronic dictionaries and Finite State Transducers for the automatic processing of the Albanian Language. We describe some peculiarities of this language ...
Odile Piton, Klara Lagji, Remzi Përnaska
ENTCS
2006
96views more  ENTCS 2006»
15 years 4 months ago
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
Patricia Bouyer