595 search results - page 17 / 119 » Languages Of Analogical Strings |
71
Voted
GG
2004
Springer
15 years 3 months ago
2004
Springer
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
114
click to vote
CRYPTO
2012
Springer
13 years 2 days ago
2012
Springer
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Automatic Speech Recognition (ASR) systems continue to make errors during search when handling various phenomena including noise, pronunciation variation, and out of vocabulary (O...
STACS
2004
Springer
15 years 3 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
ECIR
2007
Springer
14 years 11 months ago
2007
Springer
Information retrieval systems (IRSs) usually suffer from a low ability to recognize a same idea that is expressed in different forms. A way of improving these systems is to take ...