32545 search results - page 395 / 6509 » Data Structures and Algorithms |
KDD
2004
ACM
16 years 7 months ago
2004
ACM
217
click to vote
ASUNAM
2011
IEEE
14 years 6 months ago
2011
IEEE
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
208
Voted
ICDE
2010
IEEE
16 years 5 days ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
193
Voted
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...
145
Voted
PARCO
2003
15 years 8 months ago
2003
The relation between autonomous and communication phases determines the throughput of parallel structured information processing systems. Such a relation depends on the algorithm w...