Sciweavers

32 search results - page 2 / 7
» Design and Analysis of Clusters with Single I O Space
Sort
View
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 9 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ISBI
2009
IEEE
14 years 8 days ago
Image-Driven Population Analysis Through Mixture Modeling
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...
Mert R. Sabuncu
IEEEPACT
2002
IEEE
13 years 10 months ago
Workload Design: Selecting Representative Program-Input Pairs
Having a representative workload of the target domain of a microprocessor is extremely important throughout its design. The composition of a workload involves two issues: (i) whic...
Lieven Eeckhout, Hans Vandierendonck, Koenraad De ...
CGF
2010
144views more  CGF 2010»
13 years 5 months ago
Dynamic Multi-View Exploration of Shape Spaces
Statistical shape modeling is a widely used technique for the representation and analysis of the shapes and shape variations present in a population. A statistical shape model mod...
Stef Busking, Charl P. Botha, Frits H. Post
TPDS
2002
198views more  TPDS 2002»
13 years 5 months ago
Orthogonal Striping and Mirroring in Distributed RAID for I/O-Centric Cluster Computing
This paper presents a new distributed disk-array architecture for achieving high I/O performance in scalable cluster computing. In a serverless cluster of computers, all distribute...
Kai Hwang, Hai Jin, Roy S. C. Ho