11862 search results - page 64 / 2373 » Relative information completeness |
DCC
1999
IEEE
13 years 7 months ago
1999
IEEE
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
NAR
2011
12 years 10 months ago
2011
COSMIC (http://www.sanger.ac.uk/cosmic) curates comprehensive information on somatic mutations in human cancer. Release v48 (July 2010) describes over 136 000 coding mutations in ...
APLAS
2006
ACM
13 years 11 months ago
2006
ACM
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...