Sciweavers

4176 search results - page 372 / 836
» Parallelizing Support Vector Machines on Distributed Compute...
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 11 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
CLUSTER
2004
IEEE
15 years 10 months ago
Rolls: modifying a standard system installer to support user-customizable cluster frontend appliances
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
Greg Bruno, Mason J. Katz, Federico D. Sacerdoti, ...
PDP
2007
IEEE
16 years 1 months ago
A High-Level Reference Model for Reusable Object-Level Coordination Support in Groupware Applications
The success of groupware software largely depends on its capability for being reused in different collaborative scenarios without requiring significant software development effort...
Miguel A. Gomez-Hernandez, Juan I. Asensio-P&eacut...
ICPADS
2005
IEEE
16 years 13 days ago
Group Communication Protocol for Autonomic Computing
: We discuss a group protocol which supports applications with group communication service when QoS supported by networks or required by applications is changed. An autonomic group...
Tomoya Enokido, Makoto Takizawa
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader