131 search results - page 8 / 27 » Hypergraphs with independent neighborhoods |
SLOGICA
2010
13 years 6 months ago
2010
Abstract. For a first-order formula ϕ(x; y) we introduce and study the characteristic sequence Pn : n < ω of hypergraphs defined by Pn(y1, . . . , yn) := (∃x) i≤n ϕ(x; ...
VMV
2001
13 years 9 months ago
2001
This paper presents a new approach to achieve elementary neighborhood operations on both 2D and 3D binary images by using the Extreme Vertices Model (EVM), a recent orthogonal pol...
SIAMDM
2010
13 years 2 months ago
2010
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
APPROX
2004
Springer
14 years 28 days ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
ECCV
1996
Springer
14 years 9 months ago
1996
Springer
This paper presents a technique to determine the identity of objects in a scene using histograms of the responses of a vector of local linear neighborhood operators (receptive elds...