94 search results - page 1 / 19 » Testing Whether a Set of Code Words Satisfies a Given Set of... |
70
Voted
JISE
2010
14 years 9 months ago
2010
125
Voted
STOC
1993
ACM
15 years 6 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...
124
Voted
CODES
2010
IEEE
15 years 23 days 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...
102
Voted
ICALP
2005
Springer
15 years 8 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...
104
Voted
AGP
1998
IEEE
15 years 7 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 ...