Sciweavers

1402 search results - page 140 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
15 years 10 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
15 years 10 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
INFOVIS
2005
IEEE
15 years 3 months ago
Visualization of Graphs with Associated Timeseries Data
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
Purvi Saraiya, Peter Lee, Chris North
PPOPP
2006
ACM
15 years 4 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller
84
Voted
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 3 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis