387 search results - page 57 / 78 » Beyond Pairwise Clustering |
HIPC
2007
Springer
14 years 1 months ago
2007
Springer
As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, ...
MM
2005
ACM
14 years 29 days ago
2005
ACM
The number of digital photographs is growing beyond the abilities of individuals to easily manage and understand their own photo collections. Photo LOI (Level of Interest) is a te...
SC
2005
ACM
14 years 29 days ago
2005
ACM
This paper presents program transformations directed toward improving communication-computation overlap in parallel programs that use MPI’s collective operations. Our transforma...
KDD
2004
ACM
14 years 23 days ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
— As network infrastructures with 10 Gb/s bandwidth and beyond have become pervasive and as cost advantages of large commodity-machine clusters continue to increase, research and...