Sciweavers

439 search results - page 33 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
ICPP
2006
IEEE
14 years 1 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
DIS
2006
Springer
13 years 11 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
CHI
2007
ACM
14 years 8 months ago
IGroup: presenting web image search results in semantic clusters
Current web image search engines still rely on user typing textual description: query word(s) for visual targets. As the queries are often short, general or even ambiguous, the im...
Shuo Wang, Feng Jing, Jibo He, Qixing Du, Lei Zhan...
AVI
2006
13 years 9 months ago
Task taxonomy for graph visualization
Our goal is to define a list of tasks for graph visualization that has enough detail and specificity to be useful to designers who want to improve their system and to evaluators w...
Bongshin Lee, Catherine Plaisant, Cynthia Sims Par...
EUROSYS
2007
ACM
14 years 4 months ago
Dryad: distributed data-parallel programs from sequential building blocks
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational “vertices” with communication ...
Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrel...