Sciweavers

154 search results - page 27 / 31
» Binary clustering
Sort
View
79
Voted
CVPR
2008
IEEE
15 years 11 months ago
Towards unsupervised whole-object segmentation: Combining automated matting with boundary detection
We propose a novel step toward the unsupervised segmentation of whole objects by combining "hints" of partial scene segmentation offered by multiple soft, binary mattes....
Andrew N. Stein, Thomas S. Stepleton, Martial Hebe...
64
Voted
HPCC
2007
Springer
15 years 3 months ago
A Windows-Based Parallel File System
Parallel file systems are widely used in clusters to provide high performance I/O. However, most of the existing parallel file systems are based on UNIX-like operating systems. W...
Lungpin Yeh, Juei-Ting Sun, Sheng-Kai Hung, Yarsun...
DSN
2005
IEEE
15 years 3 months ago
A Wavefront Parallelisation of CTMC Solution Using MTBDDs
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equ...
Yi Zhang, David Parker, Marta Z. Kwiatkowska
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
PDP
2010
IEEE
15 years 3 months ago
Load Balancing Algorithms with Partial Information Management for the DLML Library
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...
Juan Santana-Santana, Miguel A. Castro-Garcí...