2
$\begingroup$

I noticed two questions, this one and this one, that seem to be about image processing, or possibly just research CS regarding images.

Are these on- or off-topic?

If off-topic, should these be moved to theoretical CS?

$\endgroup$
2
  • $\begingroup$ the 'computational complexity' question is not of the sort of computational complexity that would be encouraged at cstheory.SE (it also does not seem research level), the second question is probably too applied for cstheory. Both question have a problem of being unclear and under-specified. $\endgroup$
    – Artem Kaznatcheev
    Jan 10, 2012 at 12:36
  • $\begingroup$ Maybe Stack overflow, then? I agree with you that both questions are unclear and underspecified, so it's difficult to say. $\endgroup$
    – Dan
    Jan 10, 2012 at 19:31

2 Answers 2

Reset to default
1
$\begingroup$

dsp.SE, despite its name, welcomes image processing questions. If it is ever deemed that those questions have to be migrated somewhere, that is the site to consider.

$\endgroup$
1
$\begingroup$

I think the question about computational complexity isn't a good fit for the site, if only because computational complexity of algorithms tends to be more of a theoretical CS question (exceptions for SciComp would probably be along the lines of graph-theoretic algorithms or numerical linear algebra).

The question about optimization algorithms could be on-topic, but that poster's question leaves much to be desired. It's not clear what type of problem he is trying to set up.

I could see image processing questions being on topic if they involve numerical algorithms. Otherwise, I think they're probably a better fit elsewhere.

$\endgroup$
2
  • 1
    $\begingroup$ Nothing wrong with computational complexity questions related to any numerical algorithm. For instance, you could discuss the computational complexity of high-order versus low-order FEM. $\endgroup$
    – David Ketcheson
    Jan 10, 2012 at 14:32
  • 1
    $\begingroup$ Agreed. Numerical algorithms are on topic, data structures might be on topic, the computational complexity of something unrelated to numerics or graph theory is not. $\endgroup$
    – Geoff Oxberry
    Jan 10, 2012 at 19:01

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .