Sciweavers

133 search results - page 1 / 27
» Approximate Hypergraph Partitioning and Applications
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Approximate Hypergraph Partitioning and Applications
Eldar Fischer, Arie Matsliah, Asaf Shapira
DAC
1997
ACM
13 years 9 months ago
Multilevel Hypergraph Partitioning: Application in VLSI Domain
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergra...
George Karypis, Rajat Aggarwal, Vipin Kumar, Shash...
CVPR
2005
IEEE
14 years 7 months ago
Beyond Pairwise Clustering
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pi...
CORR
2011
Springer
268views Education» more  CORR 2011»
12 years 9 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
CIKM
2010
Springer
13 years 3 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad