575 search results - page 59 / 115 » A Spectral Approach to Lower Bounds |
170
click to vote
EJC
2008
15 years 5 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
173
click to vote
JMLR
2006
15 years 5 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
134
click to vote
TIP
2010
15 years 4 months ago
2010
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...
194
click to vote
RSA
2010
15 years 4 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
129
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...