34 search results - page 4 / 7 » Situations as Strings |
ICGI
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
115
click to vote
ICDCN
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
158
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
FSMNLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
100
click to vote
IJNSEC
2007
14 years 9 months ago
2007
We describe an identity based signature scheme that uses biometric information to construct the public key. Such a scheme would be beneficial in many repudiation situations for e...