We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality...
Y. del Valle, Ganesh K. Venayagamoorthy, Salman Mo...
The problem of clustering is often addressed with techniques based on a Voronoi partition of the data space. Vector quantization is based on a similar principle, but it is a diffe...
Organizations have long had the need to record and protect the knowledge that is their intellectual capital. However, the primary burden for knowledge management has been borne by...
Beatrix Zimmermann, Michael E. Atwood, Sabina Webb...
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...