94 search results - page 1 / 19 » Testing Whether a Set of Code Words Satisfies a Given Set of... |
JISE
2010
13 years 1 months ago
2010
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
CODES
2010
IEEE
13 years 5 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
ICALP
2005
Springer
14 years 18 days 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...
AGP
1998
IEEE
13 years 11 months ago
1998
IEEE
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint ...