Sciweavers

1506 search results - page 109 / 302
» On the Distribution of Natural Probability Functions
Sort
View
JCT
2011
66views more  JCT 2011»
14 years 11 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 7 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
INFOCOM
2011
IEEE
14 years 8 months ago
The resilience of WDM networks to probabilistic geographical failures
—Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures of their physical infrastructure, resulting from physical attacks (su...
Pankaj K. Agarwal, Alon Efrat, Shashidhara K. Ganj...
JCB
2008
106views more  JCB 2008»
15 years 4 months ago
Statistics of Random Protein Superpositions: p-Values for Pairwise Structure Alignment
Quantification of statistical significance is essential for the interpretation of protein structural similarity. To address this, a random model for protein structure comparison w...
James O. Wrabl, Nick V. Grishin
ENTCS
2007
85views more  ENTCS 2007»
15 years 4 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch