18 search results - page 1 / 4 » Codes on hypergraphs |
CAP
2010
14 years 5 months ago
2010
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...
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
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...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
110
click to vote
MMSEC
2006
ACM
15 years 4 months ago
2006
ACM
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...
STOC
2003
ACM
15 years 3 months ago
2003
ACM
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...