131 search results - page 10 / 27 » Hypergraphs with independent neighborhoods |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
JCT
2002
13 years 7 months ago
2002
Suppose we toss an independent coin with probability of success p for each subset of [n] = {1, . . . , n}, and form the random hypergraph P(n, p) by taking as hyperedges the subse...
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes a novel and efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images. The striking feature of th...
MLDM
1999
Springer
13 years 11 months ago
1999
Springer
Content-based image retrieval methods based on the Euclidean metric expect the feature space to be isotropic. They suer from unequal dierential relevance of features in comput...