Sciweavers

1632 search results - page 16 / 327
» On special numberings of hypergraphs
Sort
View
IS
2010
15 years 4 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
16 years 6 months ago
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
Thomas Eiter, Georg Gottlob, Kazuhisa Makino
CAIP
2009
Springer
117views Image Analysis» more  CAIP 2009»
16 years 18 days ago
A Hypergraph-Based Model for Graph Clustering: Application to Image Indexing
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
Salim Jouili, Salvatore Tabbone
PDP
2010
IEEE
16 years 27 days ago
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
Bora Ucar, Ümit V. Çatalyürek
JGAA
2006
100views more  JGAA 2006»
15 years 6 months ago
Orthogonal Hypergraph Drawing for Improved Visibility
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
Thomas Eschbach, Wolfgang Günther, Bernd Beck...