458 search results - page 20 / 92 » Perfect Skolem sets |
LOGCOM
2007
14 years 11 months ago
2007
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
110
click to vote
SIAMJO
2008
14 years 11 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
129
click to vote
COMMA
2010
14 years 6 months ago
2010
Abstract. Software tools for working with argument generally exist as large systems that wrap their entire feature set in the application as a whole. This approach, while perfectly...
106
click to vote
IJNSEC
2010
14 years 6 months ago
2010
A connection-chain refers to a mechanism in which someone recursively logs into a host, then from there logs into another host, and so on. Connection-chains represent an important...