Sciweavers

2040 search results - page 343 / 408
» Approximate Expectation Maximization
Sort
View
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
16 years 3 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 3 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 3 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
16 years 16 days ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
SASN
2003
ACM
15 years 8 months ago
Location-based pairwise key establishments for static sensor networks
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversar...
Donggang Liu, Peng Ning