Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
We propose a location-based query anonymization technique, LBS (k,T)-anonymization, that ensures anonymity of user's query in a specific time window against what we call know...
Amirreza Masoumzadeh, James Joshi, Hassan A. Karim...
Given a set of objects and a query q, a point p is
called the reverse k nearest neighbor (RkNN) of q if q is one of
the k closest objects of p. In this paper, we introduce the c...
Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Y...
In this paper, a nonparametric Bayesian estimator in the wavelet domain using the Bessel K Form (BKF) distribution will be presented. Our first contribution is to show how the BKF...