32 search results - page 2 / 7 » On Constant-Size Graphs That Preserve the Local Structure of... |
JSYML
2010
12 years 11 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
ICDM
2005
IEEE
13 years 10 months ago
2005
IEEE
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In video surveillance, the size of face images is very small. However, few works have been done to investigate scale invariant face recognition. Our experiments on appearance-base...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
BMCBI
2010
13 years 5 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...