#### Filter Results:

#### Publication Year

1976

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A table of binary constant weight codes of length n <; 28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and also a table is given of (unrestricted) binary codes of length J1 <; 28. T HE MAIN GOAL of this… (More)

Shortest network connecting all sites Uses the same algorithm Portals can be Steiner nodes! Min case different for Dynamic Programming Interface specification is slightly changed k-TSP (The shortest tour that visits at least k nodes) Need to transform the instance Need assumption OPT>L (length of the grid)

1 Introduction In this paper we introduce the notion of the limited-depth minor exclusion and show that graphs that exclude small limited-depth minors have relatively small separators. In particular, we prove that for any graph that excludes Kh as a depth 1 minor, we can find a separator of size 0(/h' logn + n/l). This, in turn, implies that any graph that… (More)

Given two distributions over an n element set, we wish to check whether these distributions are statistically close by only sampling. We give a sublinear algorithm which uses O(n 2/3 ǫ −4 log n) independent samples from each distribution , runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and… (More)

We present three new paper-based voting methods with interesting security properties. Our goal is to achieve the same security properties as recently proposed cryptographic voting protocols, but using only paper ballots and no cryptography. From a security viewpoint we get reasonably close, particularly for short ballots. However, our proposals should… (More)

| We nd a large number of \geometric separator theorems" such as: I: Given N disjoint iso-oriented squares in the plane, there exists a rectangle with 2N=3 squares inside, 2N=3 squares outside, and (4 + o(1)) p N partly in & out. II: There exists a rectangle that is crossed by the minimal spanning tree of N sites in the plane at (4 3 1=4 + o(1)) p N points,… (More)

BACKGROUND
An appropriate measure of performance is needed to identify anesthetic depth indicators that are promising for use in clinical monitoring. To avoid misleading results, the measure must take into account both desired indicator performance and the nature of available performance data. Ideally, anesthetic depth indicator value should correlate… (More)

| We show how DNA molecules and standard lab techniques may be used to create a nonde-terministic Turing machine. This is the rst scheme that shows how to make a universal computer with DNA. We claim that both our scheme and previous ones will work, but they probably cannot be scaled up to be of practical computational importance. In vivo, many of the… (More)