Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
This paper presents a high performance communication system based on generic programming. The system adapts itself according to the protocol being used on communication, simplifyi...
We present a novel strategy for automatically debugging programs given sampled data from thousands of actual user runs. Our goal is to pinpoint those features that are most correl...
Alice X. Zheng, Michael I. Jordan, Ben Liblit, Ale...
We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived f...
Pannagadatta K. Shivaswamy, Chiranjib Bhattacharyy...