Sciweavers

896 search results - page 30 / 180
» On completeness of word reversing
Sort
View
QUESTA
1998
93views more  QUESTA 1998»
13 years 9 months ago
An approximation method for complete solutions of Markov-modulated fluid models
This paper presents an approximation method for numerically solving general Markov modulated fluid models which are widely used in modelling communications and computer systems. ...
David D. McDonald, Kun Qian
GC
2011
Springer
13 years 4 months ago
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
Tao Jiang, Michael Salerno
ICASSP
2011
IEEE
13 years 1 months ago
Cross-language bootstrapping based on completely unsupervised training using multilingual A-stabil
This paper presents our work on rapid language adaptation of acoustic models based on multilingual cross-language bootstrapping and unsupervised training. We used Automatic Speech...
Ngoc Thang Vu, Franziska Kraus, Tanja Schultz
NDSS
2008
IEEE
14 years 4 months ago
Automatic Network Protocol Analysis
Protocol reverse engineering is the process of extracting application-level specifications for network protocols. Such specifications are very helpful in a number of security-re...
Gilbert Wondracek, Paolo Milani Comparetti, Christ...
STOC
1987
ACM
104views Algorithms» more  STOC 1987»
14 years 1 months ago
The Boolean Formula Value Problem Is in ALOGTIME
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
Samuel R. Buss