77 search results - page 8 / 16 » New Optimal Constant Weight Codes |
97
Voted
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
110
Voted
CODES
2007
IEEE
15 years 8 months ago
2007
IEEE
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
114
click to vote
JOIN
2007
15 years 1 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
114
click to vote
NIPS
2007
15 years 3 months ago
2007
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
96
Voted
SAC
1996
ACM
15 years 6 months ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...