Sciweavers

67 search results - page 11 / 14
» On partitioning of hypergraphs
Sort
View
JMLR
2002
157views more  JMLR 2002»
15 years 3 days ago
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that d...
Alexander Strehl, Joydeep Ghosh
93
Voted
HT
2009
ACM
15 years 7 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
15 years 4 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
HPDC
2006
IEEE
15 years 6 months ago
Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
Gaurav Khanna 0002, Nagavijayalakshmi Vydyanathan,...
IPPS
2007
IEEE
15 years 6 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...