Sciweavers

3017 search results - page 504 / 604
» On compressing social networks
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 11 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
SIGMETRICS
2011
ACM
237views Hardware» more  SIGMETRICS 2011»
13 years 26 days ago
Analysis of DCTCP: stability, convergence, and fairness
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...
Mohammad Alizadeh, Adel Javanmard, Balaji Prabhaka...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 5 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
CVPR
2007
IEEE
15 years 2 days ago
Robust Estimation of Texture Flow via Dense Feature Sampling
Texture flow estimation is a valuable step in a variety of vision related tasks, including texture analysis, image segmentation, shape-from-texture and texture remapping. This pap...
Yu-Wing Tai, Michael S. Brown, Chi-Keung Tang