The accuracy and robustness of computational models is only one side of the equation. The field of algorithmic fairness and accountability investigates the decision-making capabilities of data-driven ...

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

The Saint Louis University Department of Computer Science offers courses at the undergraduate and graduate level. Content below is provided by SLU Academic Catalog. A broad survey of the computer ...

Programming in assembly language and C for students with prior experience in Java. Topics include binary number encodings, instruction set architecture, assembly language programming, and instruction ...

Big data drives many of today’s business decisions, which makes knowledge of computer science and business invaluable for tech startups, IT consulting, investment banking and more. Leeds students have ...

If someone asks you to determine whether two objects are the same, it might seem like a trivial request. In most everyday cases, a quick glance is enough for you to render an accurate judgment. But in ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

Strict ethical and professional standards should be applied to the development of algorithms with social impacts to recover public trust in the technology, according to a report by BCS, the Chartered ...