Terry J. Wagner

According to our database1, Terry J. Wagner authored at least 31 papers between 1963 and 1982.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1982
8 Nearest neighbor methods in discrimination.
Proceedings of the Classification, Pattern Recognition and Reduction of Dimensionality, 1982

1979
Risk estimation for nonparametric discrimination and estimation rules: A simulation study (Corresp.).
IEEE Trans. Inf. Theory, 1979

Distribution-free performance bounds for potential function rules.
IEEE Trans. Inf. Theory, 1979

Distribution-free performance bounds with the resubstitution error estimate (Corresp.).
IEEE Trans. Inf. Theory, 1979

Distribution-free inequalities for the deleted and holdout error estimates.
IEEE Trans. Inf. Theory, 1979

1976
Review of 'Pattern Recognition Principles' (Tou, J. T., and Gonzalez, R. C.; 1974).
IEEE Trans. Inf. Theory, 1976

A distribution-free performance bound in error estimation (Corresp.).
IEEE Trans. Inf. Theory, 1976

1975
Nonparametric estimates of probability densities.
IEEE Trans. Inf. Theory, 1975

1974
Some Distribution-Free Aspects of Paging Algorithm Performance.
J. ACM, 1974

1973
Convergence of the edited nearest neighbor (Corresp.).
IEEE Trans. Inf. Theory, 1973

Consistency of an estimate of tree-dependent probability distributions (Corresp.).
IEEE Trans. Inf. Theory, 1973

1972
Estimation of the mean with time-varying finite memory (Corresp.).
IEEE Trans. Inf. Theory, 1972

1971
Convergence of the nearest neighbor rule.
IEEE Trans. Inf. Theory, 1971

On the capacity of a finite-state channel (Corresp.).
IEEE Trans. Inf. Theory, 1971

1970
Intersymbol interference on a continuous-time Gaussian channel.
IEEE Trans. Inf. Theory, 1970

Comments on the Estimation of Distribution Functions (Corresp.).
IEEE Trans. Inf. Theory, 1970

1969
Recursive Estimates of Probability Densities.
IEEE Trans. Syst. Sci. Cybern., 1969

Asymptotically optimal discriminant functions for pattern classification.
IEEE Trans. Inf. Theory, 1969

1968
The Rate of Convergence of an Algorithm for Recovering Functions from Noisy Measurements Taken at Randomly Selected Points.
IEEE Trans. Syst. Sci. Cybern., 1968

A Gilbert bound for periodic binary convolutional codes.
IEEE Trans. Inf. Theory, 1968

A remark on per letter converses for a discrete channel (Corresp.).
IEEE Trans. Inf. Theory, 1968

A Coding Theorem for Abstract Memoryless Channels
Inf. Control., 1968

1967
Some Additional Quasi-Perfect Codes
Inf. Control., March, 1967

On the asymptotic behavior of the approximations for the probability of error and the entropy of a stationary random process.
IEEE Trans. Inf. Theory, 1967

A comparison between pattern classification approaches (Corresp.).
IEEE Trans. Inf. Theory, 1967

Optimum (n, 2) codes for small values of channel error probability (Corresp.).
IEEE Trans. Inf. Theory, 1967

1966
A Search Technique for Quasi-Perfect Codes
Inf. Control., February, 1966

A remark concerning the existence of binary quasi-perfect codes (Corresp.).
IEEE Trans. Inf. Theory, 1966

1965
A remark concerning the minimum distance of binary group codes (Corresp.).
IEEE Trans. Inf. Theory, 1965

Some remarks concerning uncertainty and the probability of error (Corresp.).
IEEE Trans. Inf. Theory, 1965

1963
The asymptotic behavior of linear decoding for the binary symmetric channel (Corresp.).
IEEE Trans. Inf. Theory, 1963


  Loading...