Sciweavers

2131 search results - page 153 / 427
» Co-Scheduling of Computation and Data on Computer Clusters
Sort
View
PR
2008
170views more  PR 2008»
15 years 1 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
CLUSTER
2007
IEEE
15 years 8 months ago
Anomaly localization in large-scale clusters
— A critical problem facing by managing large-scale clusters is to identify the location of problems in a system in case of unusual events. As the scale of high performance compu...
Ziming Zheng, Yawei Li, Zhiling Lan
94
Voted
WWW
2010
ACM
15 years 8 months ago
Mind the data skew: distributed inferencing by speeddating in elastic regions
Semantic Web data exhibits very skewed frequency distributions among terms. Efficient large-scale distributed reasoning methods should maintain load-balance in the face of such hi...
Spyros Kotoulas, Eyal Oren, Frank van Harmelen
SAC
2004
ACM
15 years 7 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
139
Voted
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 1 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu