Sciweavers

225 search results - page 20 / 45
» Stably Computable Properties of Network Graphs
Sort
View
116
Voted
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 2 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...
CCR
2004
86views more  CCR 2004»
15 years 19 days ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
COMPLEX
2009
Springer
15 years 7 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
BICOB
2009
Springer
15 years 7 months ago
Graph Spectral Approach for Identifying Protein Domains
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...
Hari Krishna Yalamanchili, Nita Parekh
104
Voted
ADHOCNOW
2004
Springer
15 years 6 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi