#### Filter Results:

- Full text PDF available (86)

#### Publication Year

1955

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn 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(n2/3ǫ−4 logn) independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the… (More)

- Satish Rao, Warren D. Smith
- STOC
- 1998

probability l/2 in a Monte Carlo sense2 in time The main result of t,his paper is an improvement of Arora’s method to find (l+e) approximations for geometric NP-hard problems including the Euclidean Traveling Salesman Problem and t.he Euclidean Steiner Minimum Tree problems. For f&d dimension d and E, our algorithms run in O(NlogN) time. (s\/;i)… (More)

- Andries E. Brouwer, James B. Shearer, N. J. A. Sloane, Warren D. Smith
- IEEE Trans. Information Theory
- 1990

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.

- Warren D. Smith
- EVT
- 2007

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)

- Warren D. Smith
- Algorithmica
- 1992

This paper has two purposes. The first is to present a new way to find a Steiner minimum tree (SMT) connectingN sites ind-space,d >- 2. We present (in Appendix 1) a computer code for this purpose. This is the only procedure known to the author for finding Steiner minimal trees ind-space ford > 2, and also the first one which fits naturally into the… (More)

- W D Smith, R C Dutton, N T Smith
- Anesthesiology
- 1996

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)

- Serge A. Plotkin, Satish Rao, Warren D. Smith
- SODA
- 1994

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 l minor, we can find a separator of size O(lh2 logn + n=l). This, in turn, implies that any graph that excludes Kh as… (More)

Which point sets realize a given distance multiset? Interesting cases include the “turnpike problem” where the points lie on a line, the “beltway problem” where the points lie on a loop, and multidimensional versions. We are interested both in the algorithmic problem of determining such point sets for a given collection of distances and the combinatorial… (More)

- Eric B. Baum, Warren D. Smith
- Artif. Intell.
- 1997

1. The point of game tree search is to insulate oneself from errors in the evaluation function. The standard approach is to grow a full width tree as deep as time allows, and then value the tree as if the leaf evaluations were exact. This has been eeective in many games because of the computational eeciency of the alpha-beta algorithm. Our approach is to… (More)

- Warren D. Smith
- DNA Based Computers
- 1995

| 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)