Danielle Hinton

Learn More
  • Paul Njoroge, Lartey Dodoo, Danielle Hinton, Timothy Murithi, Carol Fredricks, Kate Baty
  • 2014
LIBRARIES 1 Acknowledgments I would like to thank everyone who helped me write this thesis. In Particular, Professor Vahid Tarokh for his invaluable support and guidance. His counsel and deep insight into issues was very enlightening and inspiring. Carol Fredricks and Kate Baty who offered support and encouragement during my research. I would like to thank(More)
This program seeks to determine as a function of link length relative to user density the approximate limits to the average communications rate (bits/second/Hz/user) that can be exchanged between pairs of wireless mobile users randomly distributed over a two-dimensional plane. Of primary interest is the dependence of those bit-rate limits upon coding,(More)
This program seeks to determine approximate limits to the average communications bit rate per Hz per user that can be exchanged between pairs of wireless mobile users randomly distributed over a two-dimensional plane as a function of link length relative to user density. Of primary interest is the dependence of those limits upon coding, number of antennas(More)
1. Note that the maximum number of errors for the classification networks is 504. 1. Note that the maximum number of errors for 'Balance' and 'Depth' is 540, and 504 for the other simulations (since the balanced trees are not included then) especially hard for constituents that appear at deeper levels of the tree, and is also true even if the RAAM can(More)
A fast stochastic error-descent algorithm for supervised learning and optimization. (1991). Weight perturbation: An optimal architecture and learning technique for analog vlsi feedforward and recurrent multilayer networks. (1991). Learning continuous probability distributions with the con-trastive Hebbian algorithm. 10 appears in many theories of(More)
  • 1