Sciweavers

1985 search results - page 356 / 397
» Multiresolution Analysis of Connectivity
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Mining interesting link formation rules in social networks
Link structures are important patterns one looks out for when modeling and analyzing social networks. In this paper, we propose the task of mining interesting Link Formation rules...
Cane Wing-ki Leung, Ee-Peng Lim, David Lo, Jianshu...
JSAC
2010
131views more  JSAC 2010»
14 years 8 months ago
BGP Add-Paths: The Scaling/Performance Tradeoffs
— Internet Service Providers design their network with resiliency in mind, having multiple paths towards external IP subnets available at the borders of their network. However, w...
Virginie Van den Schrieck, Pierre François,...
RSA
2010
94views more  RSA 2010»
14 years 8 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
TALG
2010
86views more  TALG 2010»
14 years 8 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu