Sciweavers

74 search results - page 5 / 15
» New length bounds for cycle bases
Sort
View
RECOMB
2000
Springer
13 years 11 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
14 years 27 days ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
INFOCOM
1997
IEEE
13 years 11 months ago
Collision Avoidance and Resolution Multiple Access with Transmission Groups
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-...
Rodrigo Garcés, J. J. Garcia-Luna-Aceves
IEICET
2011
13 years 2 months ago
The Security of Abreast-DM in the Ideal Cipher Model
Abstract. In this paper, we give a security proof for Abreast-DM in terms of collision resistance and preimage resistance. As old as Tandem-DM, the compression function Abreast-DM ...
Jooyoung Lee, Daesung Kwon
DAC
2004
ACM
14 years 8 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...