Sciweavers

9227 search results - page 1725 / 1846
» Developing Use Cases from Organizational Modeling
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
15 years 4 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
BMCBI
2006
99views more  BMCBI 2006»
15 years 4 months ago
A proposed metric for assessing the measurement quality of individual microarrays
Background: High-density microarray technology is increasingly applied to study gene expression levels on a large scale. Microarray experiments rely on several critical steps that...
Kyoungmi Kim, Grier P. Page, T. Mark Beasley, Step...
TAP
2008
Springer
93views Hardware» more  TAP 2008»
15 years 4 months ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
JAR
2000
145views more  JAR 2000»
15 years 4 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
14 years 4 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters
« Prev « First page 1725 / 1846 Last » Next »