Sciweavers

5653 search results - page 1002 / 1131
» Distributed Conceptual Structures
Sort
View
PODC
2009
ACM
16 years 3 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
KDD
2009
ACM
164views Data Mining» more  KDD 2009»
16 years 3 months ago
Social influence analysis in large-scale networks
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...
Jie Tang, Jimeng Sun, Chi Wang, Zi Yang
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 3 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 3 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
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 ...
« Prev « First page 1002 / 1131 Last » Next »