1717 search results - page 151 / 344 » A Computable Spectral Theorem |
129
click to vote
EJC
2000
15 years 4 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
155
click to vote
FAC
2010
15 years 2 months ago
2010
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
135
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Although many color constancy methods exist, they are all based on specific assumptions such as the set of possible light sources, or the spatial and spectral characteristics of i...
152
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
123
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We consider the problem of dimensionality reduction, where given high-dimensional data we want to estimate two mappings: from high to low dimension (dimensionality reduction) and f...