Please get in touch with me if you are interested.
Category: Positions, Jobs & Internships
Research position in Portugal
INESC TEC (https://www.inesctec.pt/ip-en) at Porto, Portugal, is accepting applications to award 1 Research Grant for MSC within the Project “TEC4Growth – RL FourEyes – Intelligence, Interaction, Immersion and Innovation for media industries (NORTE-01-0145-FEDER-000020)” to support a PhD thesis on “Temporal News IR”.
Work area: Text Mining and Information Retrieval.
Academic Qualifications: MSc in Computer Science, Computer Engineering or similar;
Minimum Profile required: Research experience in Information Retrieval and Text Mining. Fluency in English (oral and written);
Preference factors: Good programming skills (preferably C#). Knowledge in the fields of information retrieval/text mining/information extraction.
The position is offered for an initial period of one year (from 2016-05-01 a 2017-04-30) and may be renewed for additional periods.
Application Period: 2016-04-07 to 2016-04-21
If you want to apply for this position, please follow the corresponding link and read the details about the application procedure at https://www.inesctec.pt/ip-en/work-with-us/bolsas-inescporto/concurso-para-a-atribuicao-de-1-bolsa-de-investigacao-para-mestre-no-projeto-tec4growth-rl-foureyes?set_language=en&cl=en
For further inquiries regarding the position, please contact Prof. Ricardo Campos
—————————————————————————————
Ricardo Campos
Assistant Professor – ICT Department
Polytechnic Institute of Tomar at Tomar, Portugal
Researcher
LIADD – INESC TEC at University of Porto, Portugal
e-mail: ricardo.campos@ipt.pt
e-mail: ricardo.campos@inesctec.pt
Web: http://www.ccc.ipt.pt/~ricardo
—————————————————————————————
PhD position in Bioinformatics in Lille, France
Two PhD positions are available in the Bonsai group (Lille, France),
starting
Fall 2016:
* Algorithms for analyzing assembly graphs from third-generation DNA
sequencing (with R. Chikhi, J-S. Varré)
* Algorithms for finding motifs in alignments of small RNA-sequencing
data in
plant genomes (with H. Touzet, R. Chikhi)
Recent DNA and RNA sequencing technologies yield a large amount of
short sequence fragments that need to be analyzed
computationally. Broadly speaking, these PhD offers deal with
algorithms for the analysis of such sequencing data.
Pre-requisites:
A master degree in computer science or bioinformatics, and more
specifically a good knowledge of methods in discrete algorithms.
Knowledge in biology is not a requirement, but then the applicant
should have a strong computational background and be interested
in biological problems.
How to apply:
Send applications or inquiries to helene.touzet@inria.fr,
rayan.chikhi@inria.fr,
jean-stephane.varre@univ-lille1.fr Applications should include a CV, a
transcript of master-level grades and the name of two references.
Deadline: April 15, 2016
Bonsai (http://www.cristal.univ-lille.fr/bonsai) is a bioinformatics
research group at University of Lille, affiliated with INRIA Lille –
Nord Europe and CRIStAL (Université Lille 1, CNRS). The main goal of
our research is to define combinatorial models and efficient
algorithms for large-scale sequence analysis in molecular
biology. This includes genome annotation, high-throughput sequencing,
metagenomics, noncoding RNAs, genome structure, non ribosomal peptides.
Faculty position in Berlin in the field of algorithms
Technische Universität Berlin
Faculty IV – Electrical Engineering and Computer Science
Department of Software Engineering and Theoretical Computer Science
offers an open position of a
Junior professor – salary grade W1 –
in the field of “Efficient Algorithms”.
Reference number: IV-68/16
(starting at the earliest possible / to be filled as soon
as possible for a period of 3 years;
an extension of 3 more years is possible after successful evaluation /
closing date for applications 28/04/16)
Working field: The position includes teaching duties in the Bachelor and
Master programs “Computer Science”, “Computer Engineering”, and
“Information Systems Engineering and Management”. In addition, an active
participation in Berlin’s algorithmic research (in particular concerning
successful grant application, cooperations, committee work, regular
publications) is expected.
Requirements: Candidates must meet the requirements of the Berlin Higher
Education Act (§102a BerlHG)
(the information leaflet will be forwarded upon request), including a
completed academic education, qualified achievements in research,
usually proven by an outstanding doctoral thesis (PhD),
educational and didactic competences. We are seeking a scientist with
a PhD and expertise in the theoretical study of algorithms or a closely
related area. Applicants should have a strong scientific track record
witnessed by publications in peer-reviewed journals
and conferences related to algorithmic research.
Applicants should be experts in one of the following research areas or
in a related field:
* algorithm engineering,
* algorithms for massive data (in particular streaming algorithms),
* algorithmic game theory,
* approximation and online algorithms,
* data structures,
* graph algorithms,
* parameterized algorithms,
* randomized algorithms.
In addition, knowledge in one or more areas of applied computer science
is favourable, for example in
* bioinformatics,
* computational social choice,
* data mining,
* machine learning,
* social network analysis.
Technische Universität Berlin strives to increase the proportion of
women in research and teaching and therefore
strongly encourages qualified female researchers to apply. Qualified
individuals with disabilities will be favored.
Technische Universität Berlin is a certified family-friendly higher
education institution, and our Dual Career Service offers assistance to
you and your family when relocating to Berlin.
Please send your written application with the reference number and the
usual documents (including a CV listing publications, teaching
experience etc., copies of academic degrees,
as well as copies of up to five selected publications)
until 28/04/2016 to
Technische Universität Berlin – Der Präsident -, Dekan der Fakultät IV,
Sekr. MAR 6-1, Marchstr. 23,
D-10587 Berlin, Germany
or by email to bianca.hahn@tu-berlin.de
Opportunity for research experience for undergraduates in Machine Learning
AN OPPORTUNITY FOR A 10-WEEK RESEARCH EXPERIENCE FOR UNDERGRADUATE STUDENTS is available in the area of Machine Learning. The program is sponsored by the National Science Foundation and is offered by the Information Characterization & Exploitation (ICE) Laboratory at Florida Institute of Technology (FIT) in Melbourne, Florida.
Machine Learning (ML) gradually evolved as a branch of Artificial Intelligence with its theory and applications positioned at the juncture of Computer Science, Engineering, Mathematics, Statistics and, even, Physics. Nowadays, ML’s role in successfully addressing hard, real-world technological challenges has become ever more current and central. Moreover, its presence and importance now permeates several aspects not only of cutting-edge technology such as computer vision, stock market prediction and big data analytics, but also our daily life through voice-driven searches on our smart phones or movie recommendations on video streaming services to name only a few.
The program currently accepts applications in order to form a very diverse, multi-disciplinary cohort of nascent researchers for this summer. Minorities, women and people with disabilities are especially encouraged to apply.
ELIGIBILITY
Without exceptions, applicants must be:
=> Majoring in an Engineering or Science discipline
=> US citizens or permanent residents
=> Undergraduates in good academic standing
BENEFITS
=> Exposure to the exciting world of Machine Learning and its applications
=> Participate in a one-week crash course to familiarize yourself with Machine Learning
=> Work with experienced student mentors and experts in the field
=> Participate and contribute to cutting-edge Machine Learning research
=> Take part in visits to our local industry
=> Paid travel and accommodation expenses
=> Receive a competitive stipend for per diem expenses
=> Visit Central Florida venues such as Disney attractions and NASA’s Kennedy Space Center
=> Meet new people
=> Make new friends
Application Deadline: March 31, 2016
Apply online: http://www.amalthea-reu.org
For more information, visit our Web site at www.amalthea-reu.org or contact:
Dr. Georgios C. Anagnostopoulos
Director, The AMALTHEA REU Program
Associate Professor, ECE Dept.
Florida Institute of Technology
150 West University Boulevard
Melbourne, Florida 32901-6975
Phone 321-674-7125 | Fax 321-674-8192
E-mail: georgio@fit.edu
Algorithms postdoc in Italy
A 1-year postdoc position is available at the Department of Computer Science of the
University of Milano-Bicocca, starting from June 1st 2016.
The position is within the Experimental Algorithmics research group focusing on efficient
algorithms in Bioinformatics, especially on NGS data. The position is funded on joint
project with the National Institute of Molecular Genetics.
We are looking for a postdoc with experience in developing and implementing algorithms for
indexing, querying, or analyzing genomic and transcriptomics data.
The salary is competitive and negotiable, provided a declaration of interest and a CV are
sent to Paola Bonizzoni (bonizzoni@disco.unimib.it) and Gianluca Della Vedova
(gianluca.dellavedova@unimib.it) by March 18th.
For more information on the position, please contact Paola Bonizzoni
(bonizzoni@disco.unimib.it) and Gianluca Della Vedova (gianluca.dellavedova@unimib.it).
Postdoctoral position in Algorithms in Paris
The Algorithms and Complexity group of IRIF – previously LIAFA –
(CNRS and University Paris Diderot), Paris, France, is seeking excellent
candidates for one or more postdoctoral positions. The financing of this position
is provided by the ANR grant RDAM joint to that group and the Talgo team of the
Computer Science Department at the Ecole Normale Superieure, Paris.
Topics of interest include (but are not limited to):
algorithms, streaming algorithms, approximation algorithms, online algorithms,
computational game theory; and the application to those areas, or the
development, of complexity tools such as communication complexity or
information theory.
The successful candidate will be based at the Algorithms and Complexity
group of IRIF, but will be expected to interact also with the Talgo team
(located just 15 minutes away), and to work jointly with members of
both teams.
IRIF is a joint laboratory of the CNRS (the French National Center
for Scientific Research) and University Paris Diderot – Paris 7.
For more information about IRIF, please see
http://www.irif.univ-paris-diderot.fr/en/index ,
and for more information about the Algorithms and Complexity group
please see https://www.irif.univ-paris-diderot.fr/en/equipes/algo/index .
The Computer Science Department of the Ecole Normale Superieure
is a joint laboratory of the ENS, the CNRS, and INRIA. For more informations
about that department please see:
http://www.di.ens.fr/WebHome.html.en ,
and for more information about the Talgo team please see:
http://www.di.ens.fr/TalgoTeam.html.en .
The starting date of the position will usually be in September 2016
but can be negotiated.
The application should include a CV, a summary of research and
names of at least three references. For further instructions on how to
submit applications, please visit the “openings” sections at:
http://algo.irif.univ-paris-diderot.fr/ .
Due to a tight schedule, applications should be received by March 31, 2016.
Postdoc in Denmark
Postdoc position in Helsinki
A postdoc position is available at the Department of Computer Science of the University of Helsinki for a negotiable period between summer 2016 and end of 2017.
The position is within the Genome-scale algorithmics research group that develops algorithms and data structures for the analysis of genome-scale data. Such data is abundant due to modern molecular biology measurement techniques like high-throughput sequencing. We are especially interested in applications of compressed data structures. We are looking for a postdoc to bring new expertise in our current research areas such as pan-genome indexing, time- and space-optimal sequence analysis, and genome and transcript assembly.
The application procedure (with deadline April 1st 2016 at 2pm Finnish time) is described at
http://www.hiit.fi/openpositions/postdoctoral-researchers-and-research-fellow-positions-computer-science
For more information on the position, please contact Veli Mäkinen (veli.makinen@helsinki.fi).