Sciweavers

Share
18 search results - page 1 / 4
» Codes on hypergraphs
Sort
View
CORR
2008
Springer
58views Education» more  CORR 2008»
8 years 3 months ago
Codes on hypergraphs
Alexander Barg, Arya Mazumdar, Gilles Zémor
FOCS
2002
IEEE
8 years 8 months ago
The Hardness of 3 - Uniform Hypergraph Coloring
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
Irit Dinur, Oded Regev, Clifford D. Smyth
CAP
2010
7 years 10 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
MMSEC
2006
ACM
195views Multimedia» more  MMSEC 2006»
8 years 9 months ago
Image annotation watermarking: nested object embedding using hypergraph model
In this paper, we introduce to the special domain of image annotation watermarking, based on embedding of hierarchical data related to objects into user-selected areas on an image...
Claus Vielhauer, Maik Schott
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
8 years 8 months ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...
books