265 search results - page 37 / 53 » Properties and computations of matrix pseudospectra |
104
click to vote
PAMI
2007
14 years 9 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
SEMCO
2007
IEEE
15 years 4 months ago
2007
IEEE
Human visual recognition is based largely on shape, yet effectively using shapes in natural image retrieval is a challenging task. Most existing methods are based on the geometric...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
112
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
The covariance region descriptor recently proposed in [1] has been proved robust and versatile for a modest computational cost. The covariance matrix enables efficient fusion of d...