qimie2015

Call for paper

Important notices

Submitting a paper to the QIMIE'15 workshop (see QIMIE'15 topics and main themes) means that if the paper is accepted, at least one author should attend the workshop to present the paper. The registration fees for workshops will be determined by the conference (not the workshop itself). The fees will be paid to the conference, and the conference will provide workshop facilities including working notes printing, meeting room, coffee break, lunch, QIMIE'15 proceedings, etc.

Publication and Proceedings

  • Accepted paper presented at QMIE'15 will be published in informal Proceedings (with ISBN)
  • Outstanding Papers presented at QMIE'15 will be published in a LNCS/LNAI Post Proceedings of PAKDD Workshops published by Springer.
  • Selected and revised papers will be considered for the special issue of the Vietnam Journal of Computer Science associated with the QIMIE workshop.

 

 

Important Dates (expected)

Workshop paper submission deadline: 16 March 2015

Workshop author notification: 3 April 2015

Workshop camera-ready due  & registration: 17 April 2015

Workshop date: 19 May 2015

Submission web site

QIMIE will use EasyChair: if you have no EasyChair account please sign up first at EasyChair for an account.

https://www.easychair.org/conferences/?conf=qimie2015

Submission instructions

Each paper should consist of a cover page with title, authors’ names, postal and email address, an up to 200-words abstract, up to 5 keywords and a body not longer than 12 single-spaced pages with font size at least 11 pts.

Authors should use LNCS Springer’s manuscript submission guidelines (available at http://www.springer.de/comp/lncs/authors.html) for their initial submissions. All papers must be submitted electronically in PDF format only.

The submitted papers must not be published or under consideration to be published elsewhere. Each paper will be reviewed by at least two members of the Program Committee on the basis of technical quality, relevance, significance, and clarity.