Sciweavers

215 search results - page 33 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
BMCBI
2007
117views more  BMCBI 2007»
14 years 9 months ago
DNA-based watermarks using the DNA-Crypt algorithm
Background: The aim of this paper is to demonstrate the application of watermarks based on DNA sequences to identify the unauthorized use of genetically modified organisms (GMOs) ...
Dominik Heider, Angelika Barnekow
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 9 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
3DPVT
2002
IEEE
131views Visualization» more  3DPVT 2002»
15 years 2 months ago
Octree approximation and compression methods
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The ...
Hanan Samet, Andrzej Kochut
ICSE
2009
IEEE-ACM
15 years 4 months ago
Does distributed development affect software quality? An empirical case study of Windows Vista
It is widely believed that distributed software development is riskier and more challenging than collocated development. Prior literature on distributed development in software en...
Christian Bird, Nachiappan Nagappan, Premkumar T. ...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 4 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day