Sciweavers

3820 search results - page 717 / 764
» Bounded Model Debugging
Sort
View
IANDC
2008
105views more  IANDC 2008»
13 years 10 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
BMCBI
2006
75views more  BMCBI 2006»
13 years 10 months ago
A machine learning strategy to identify candidate binding sites in human protein-coding sequence
Background: The splicing of RNA transcripts is thought to be partly promoted and regulated by sequences embedded within exons. Known sequences include binding sites for SR protein...
Thomas Down, Bernard Leong, Tim J. P. Hubbard
COMCOM
2006
168views more  COMCOM 2006»
13 years 10 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
BMCBI
2007
139views more  BMCBI 2007»
13 years 10 months ago
Significance analysis of microarray transcript levels in time series experiments
Background: Microarray time series studies are essential to understand the dynamics of molecular events. In order to limit the analysis to those genes that change expression over ...
Barbara Di Camillo, Gianna Toffolo, Sreekumaran K....
EJC
2007
13 years 10 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...