Sciweavers

3068 search results - page 124 / 614
» Clustering with Multiple Graphs
Sort
View
ICDCS
2006
IEEE
16 years 26 days ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
JMLR
2010
113views more  JMLR 2010»
15 years 1 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
ISCA
1994
IEEE
104views Hardware» more  ISCA 1994»
15 years 11 months ago
Exploring the Design Space for a Shared-Cache Multiprocessor
In the near future, semiconductor technology will allow the integration of multiple processors on a chip or multichipmodule (MCM). In this paper we investigate the architecture an...
Basem A. Nayfeh, Kunle Olukotun
CLUSTER
2007
IEEE
16 years 1 months ago
Effects of packet pacing for MPI programs in a Grid environment
— Improving the performance of TCP communication is the key to the successful deployment of MPI programs in a Grid environment in which multiple clusters are connected through hi...
Ryousei Takano, Motohiko Matsuda, Tomohiro Kudoh, ...
PVLDB
2010
146views more  PVLDB 2010»
15 years 1 months ago
HaLoop: Efficient Iterative Data Processing on Large Clusters
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
Yingyi Bu, Bill Howe, Magdalena Balazinska, Michae...