Sciweavers

1399 search results - page 85 / 280
» New Algorithms for k-Center and Extensions
Sort
View
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
13 years 11 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
Wei Chen, Chi Wang, Yajun Wang
DMIN
2009
222views Data Mining» more  DMIN 2009»
13 years 7 months ago
P-Sensitive K-Anonymity for Social Networks
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
Roy Ford, Traian Marius Truta, Alina Campan
EJWCN
2010
119views more  EJWCN 2010»
13 years 4 months ago
Simulations of the Impact of Controlled Mobility for Routing Protocols
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
Valeria Loscrì, Enrico Natalizio, Carmelo C...
CVPR
2012
IEEE
11 years 11 months ago
Probabilistic tensor voting for robust perceptual grouping
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
Dian Gong, Gérard G. Medioni