Sciweavers

2018 search results - page 296 / 404
» Code Normal Forms
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 9 months ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot
DCG
2010
53views more  DCG 2010»
13 years 9 months ago
A Revision of the Proof of the Kepler Conjecture
Abstract. The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. Th...
Thomas C. Hales, John Harrison, Sean McLaughlin, T...
DEBU
2008
131views more  DEBU 2008»
13 years 9 months ago
Testing Berkeley DB
Oracle Berkeley DB is a family of database engines that provide high performance, transactional data management on a wide variety of platforms. Berkeley DB products are available ...
Ashok Joshi, Charles Lamb, Carol Sandstrom
IJNSEC
2006
71views more  IJNSEC 2006»
13 years 8 months ago
Fundamental Limits on a Model of Privacy-Trust Tradeoff: Information Theoretic Approach
Zhong et al. formulated the problem of disclosing credentials (associated with privacy) for building trust in an open environment like Internet. Thus, one form of privacy-trust pr...
Rama Murthy Garimella
ENTCS
2007
81views more  ENTCS 2007»
13 years 8 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan