Sciweavers

5962 search results - page 98 / 1193
» Efficient Clustering for Orders
Sort
View
CLUSTER
2005
IEEE
15 years 12 months ago
Service Level Agreement based Allocation of Cluster Resources: Handling Penalty to Enhance Utility
Jobs submitted into a cluster have varying requirements depending on user-specific needs and expectations. Therefore, in utility-driven cluster computing, cluster Resource Manage...
Chee Shin Yeo, Rajkumar Buyya
BMCBI
2008
122views more  BMCBI 2008»
15 years 6 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
JGTOOLS
2006
199views more  JGTOOLS 2006»
15 years 6 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman
CAP
2010
15 years 1 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ASAP
2000
IEEE
142views Hardware» more  ASAP 2000»
15 years 10 months ago
Contention-Conscious Transaction Ordering in Embedded Multiprocessors
This paper explores the problem of efficiently ordering interprocessor communication operations in statically-scheduled multiprocessors for iterative dataflow graphs. In most digi...
Mukul Khandelia, Shuvra S. Bhattacharyya