In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
For r 3, n N and each 3-monotone continuous function f on [a, b] (i.e., f is such that its third divided differences [x0, x1, x2, x3] f are nonnegative for all choices of distin...
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
Phishers are fraudsters that mimic legitimate websites to steal user’s credential information and exploit that information for identity theft and other criminal activities. Vari...
Eric Lin, Saul Greenberg, Eileah Trotter, David Ma...