275 search results - page 12 / 55 » Component factors with large components in graphs |
AIPS
2010
15 years 2 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have...
ICB
2007
Springer
15 years 1 months ago
2007
Springer
In this paper we present a face recognition method based on multiway analysis of color face images, which is robust to varying illumination conditions. Illumination changes cause l...
87
Voted
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
107
click to vote
BMCBI
2010
14 years 11 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...