We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...