Sciweavers

14 search results - page 2 / 3
» Pairs, sets and sequences in first-order theories
Sort
View
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 8 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
BMCBI
2010
108views more  BMCBI 2010»
13 years 7 months ago
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs ...
Fernando Garcia-Alcalde, Armando Blanco, Adrian J....
BMCBI
2007
105views more  BMCBI 2007»
13 years 7 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
14 years 4 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
TSE
2011
180views more  TSE 2011»
13 years 2 months ago
Developing a Single Model and Test Prioritization Strategies for Event-Driven Software
—Event-Driven Software (EDS) can change state based on incoming events; common examples are GUI and web applications. These EDS pose a challenge to testing because there are a la...
Renée C. Bryce, Sreedevi Sampath, Atif M. M...