Sciweavers

7821 search results - page 1520 / 1565
» Nested Ordered Sets and their Use for Data Modelling
Sort
View
SPAA
2010
ACM
15 years 21 days ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
129
Voted
BMCBI
2011
14 years 4 months ago
MINE: Module Identification in NEtworks
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
Kahn Rhrissorrakrai, Kristin C. Gunsalus
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 2 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 1 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
116
Voted
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
16 years 27 days ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
« Prev « First page 1520 / 1565 Last » Next »