Sciweavers

2131 search results - page 389 / 427
» Co-Scheduling of Computation and Data on Computer Clusters
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
CF
2010
ACM
14 years 10 days ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 3 months ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy
COOPIS
2004
IEEE
14 years 23 days ago
A Distributed and Parallel Component Architecture for Stream-Oriented Applications
Abstract. This paper introduces ThreadMill - a distributed and parallel component architecture for applications that process large volumes of streamed (time-sequenced) data, such a...
Paulo Barthelmess, Clarence A. Ellis
BMCBI
2010
113views more  BMCBI 2010»
13 years 9 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu