Sciweavers

33 search results - page 4 / 7
» bell 2000
Sort
View
BELL
2000
107views more  BELL 2000»
13 years 9 months ago
Automating software feature verification
A significant part of the call processing software for Lucent's new PathStar access server [FSW98] was checked with automated formal verification techniques. The verification...
Gerard J. Holzmann, Margaret H. Smith
ACSC
2000
IEEE
14 years 2 months ago
A Low-Cost High-Impact Computer Science Show for Family Audiences
Science shows are commonly presented for the general public, and especially children, at science centers and festivals. Usually they use attention-grabbing experiments from the ph...
Tim Bell
COMBINATORICS
2000
82views more  COMBINATORICS 2000»
13 years 9 months ago
When Structures Are Almost Surely Connected
Let An denote the number of objects of some type of "size" n, and let Cn denote the number of these objects which are connected. It is often the case that there is a rel...
Jason P. Bell
ANLP
1997
81views more  ANLP 1997»
13 years 11 months ago
Name pronunciation in German text-to-speech synthesis
We describe the name analysis and pronunciation component in the German version of the Bell Labs multilingual text-tospeech system. We concentrate on street names because they enc...
Stefanie Jannedy, Bernd Möbius
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 9 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...