Sciweavers

15254 search results - page 46 / 3051
» A k
Sort
View
MST
2010
98views more  MST 2010»
14 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
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...
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 7 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
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...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
GIS
2009
ACM
14 years 7 months ago
LBS (k, T)-anonymity: a spatio-temporal approach to anonymity for location-based service users
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...
ICDE
2011
IEEE
380views Database» more  ICDE 2011»
14 years 1 months ago
Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries
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...
ICIP
2005
IEEE
15 years 11 months ago
Bayesian denoising based on the MAP estimation in wavelet-domain using Bessel K form prior
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...
Larbi Boubchir, Jalal Fadili