Current students

Finn Lidbetter, Master’s candidate
David R. Cheriton School of Computer Science

The fundamental problem of additive number theory is to determine whether there exists an integer m such that every nonnegative integer (resp., every sufficiently large nonnegative integer) is the sum of at most m elements of S. If so, we call S an additive basis of order m (resp., an asymptotic additive basis of order m). If such an m exists, we also want to find the smallest such m.

Vern Paxson
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
Chief Scientist, Corelight, Inc.
Lead, Networking and Security Group, International Computer Science Institute

Daniel Recoskie, PhD candidate
David R. Cheriton School of Computer Science

The wavelet transform has seen success when incorporated into neural network architectures, such as in wavelet scattering networks. More recently, it has been shown that the dual-tree complex wavelet transform can provide better representations than the standard transform.