Re: Choosing a place to publish
- From: Nicolas Bonneel <nicolas.bonneel.asupprimer@xxxxxxxxxx>
- Date: Wed, 05 Aug 2009 22:57:43 +0200
Kaba a écrit :
Nicolas Bonneel wrote:For computer graphics in general, journals are not better than conferences (at least because journals can take years to publish an article which has been accepted, and computer graphics and hardware evolve too fast so that it's tolerable). In practice, some conferences in graphics are associated with journals, in special issues, so the best thing to do if you want a journal paper is to submit to such conferences (which are fast to publish).
I am not familiar with the correct terms yet. For all the papers that I've been involved with, someone else has chosen the publication place.
So hmm.. A journal is a collection of papers that is published at regular intervals, for example 4 times a year or so, right?
A conference would be a place where the accepted and peer-reviewed papers are represented to an audience and then maybe (or always?) compiled to conference proceedings?
What else is there to terminology?
The difference mainly lies in the reviewing process. For a journal, you send your submission, you get feedbacks, you do their correction and submit again, they give you other feedbacks, you correct [etc..] until convergence and final acceptation. It finally get published in a journal (as you said, a collection of articles, usually several times a year).
For conferences, you submit your article and you get either accepted or rejected, that's all (except for siggraph and siggraph asia where there is a short rebuttal period where you can correct for factual errors in the reviews). The conference is usually once a year, where you do an oral presentation of your work, and the article gets printed in the proceedings. For a few of the conferences, the proceedings are in fact a special issue of a given journal.
Except if you highly motivate your kd-tree research for graphics, there is little hope that it will be accepted in these conferences (which are very graphics oriented). However, if you motivate it by showing some CG applications, then it may be fine.
Just recall that Siggraph and Siggraph Asia have about 15% acceptance rate, and that there is also a self selection (you usually don't submit if you're sure to be rejected)... so don't hope too much. There is also a part of randomness at the end.
I can be more specific. I have something about point containing kd-trees especially in connection with nearest neighbors searching (but not restricted to). I agree that it doesn't seem to fit any of those mentioned, for example, in Kesen Huang's nice webpage you linked to.
kd-trees are highly used in the final gathering step in photon mapping. Nearest neighbor searches are also used in neighborhood-based texture synthesis. There is generally a wide range of CG applications of nearest neighbors. If your algo is, for example, efficiently parallelizable, you may want to implement it on the GPU to show some realtime CG demos.
In short, it's not a graphics related journal that I should be searching for.[...]
These names are from quite old papers. The computational geometry is the only that clearly comes out. Maybe that's where I should look.
I also think so. However, I don't really know this field.
Maybe in some machine learning/data mining journals as well ?...
But then it's harder to compare journals of different domains (even using their impact factor).
Cheers
--
Nicolas Bonneel
http://www-sop.inria.fr/reves/Nicolas.Bonneel/
.
- Follow-Ups:
- Re: Choosing a place to publish
- From: Kaba
- Re: Choosing a place to publish
- From: Nicolas Bonneel
- Re: Choosing a place to publish
- References:
- Choosing a place to publish
- From: Kaba
- Re: Choosing a place to publish
- From: Nicolas Bonneel
- Re: Choosing a place to publish
- From: Kaba
- Choosing a place to publish
- Prev by Date: Re: building a 3d model
- Next by Date: Re: Quaternion to Euler (ZXY order)
- Previous by thread: Re: Choosing a place to publish
- Next by thread: Re: Choosing a place to publish
- Index(es):
Loading