Sciweavers

1359 search results - page 186 / 272
» Probabilistic Points-to Analysis
Sort
View
109
Voted
EJC
2006
15 years 23 days ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer
COMCOM
2007
103views more  COMCOM 2007»
15 years 22 days ago
Using event detection latency to evaluate the coverage of a wireless sensor network
A wireless sensor network (WSN) consists of many tiny and low-power devices deployed in a sensing field. One of the major tasks of a WSN is to monitor the surrounding environment...
You-Chiun Wang, Kai-Yang Cheng, Yu-Chee Tseng
115
Voted
ISCI
2008
137views more  ISCI 2008»
15 years 22 days ago
Stochastic dominance-based rough set model for ordinal classification
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has...
Wojciech Kotlowski, Krzysztof Dembczynski, Salvato...
110
Voted
JCB
2008
108views more  JCB 2008»
15 years 22 days ago
Asymptotics of RNA Shapes
Abstract. RNA shapes, introduced by Giegerich et al. (17), provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exa...
W. A. Lorenz, Yann Ponty, Peter Clote
115
Voted
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 22 days ago
A Note on the Periodicity and the Output Rate of Bit Search Type Generators
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
Yucel Altug, N. Polat Ayerden, Mehmet Kivanç...