\documentclass[11pt]{article}
\usepackage[letterpaper, left=1in, top=1in, bottom=1in, right=1in]{geometry}
\usepackage{verbatim}
\setlength{\parindent}{0in}
\pagestyle{empty}
\begin{document}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Computer Science}
\par
\textsc{Seminar}
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textit{Mapping skeleton workflows onto heterogeneous platforms}
\end{center}
\vspace{\fill}
\begin{center}\Large
Anne Benoit\par
Ecole Normale Supérieure de Lyon, France
\end{center}
\vspace{\fill}
\textbf{Abstract:} Mapping workflow applications onto parallel platforms is a challenging
problem, even for simple application patterns such as pipeline graphs.
Several antagonist criteria should be optimized, such as throughput,
latency, reliability (or a combination). Typical applications include
digital image processing, where images are processed in steady-state
mode. In this talk, we study the complexity of various multi-criteria
mapping problems for pipeline graphs. For some NP-hard instances of
the problem, polynomial bi-criteria heuristics are presented and their
relative performance is evaluated through extensive simulations.\vspace{\fill}
\begin{center}\Large
Monday, March 17, 2008, 3:00 pm\par
Mathematics and Science Center: W306
\end{center}
\vspace{\fill}
\begin{center}\Large

\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Mathematics and Computer Science}\par
\textsc{Emory University}
\end{center}
\end{document}