Sciweavers

2270 search results - page 346 / 454
» On the distribution of eigenvalues of graphs
Sort
View
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 9 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
CIKM
2008
Springer
15 years 8 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 7 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
SOFTVIS
2010
ACM
15 years 6 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
CCR
2010
184views more  CCR 2010»
15 years 6 months ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...