The course introduces basic data structures and algorithmic techniques that allow students to solve computational problems on the most important data types, such as sequences, sets, trees, and graphs.

The Formal Analysis, Theory and Algorithms section (FATA) is a large and very active research group in theoretical computer science, currently leading or contributing to research grants funded by a ...

Abstract: This paper investigates efficient maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over erasure channels. A set of algorithms, referred to as pivoting algorithms, is ...

Pioneering computer scientist who devised the Quicksort algorithm, ways of verifying programs and guards against hackers Tony Hoare, who has died aged 92, did much to transform computer program ...

Abstract: Endmember extraction represents one of the most challenging aspects of hyperspectral image processing. In this letter, a new algorithm for endmember extraction, named modified vertex ...

The early stage pathogens of plant diseases have the characteristic of low concentration and difficult detection, which exacerbates the difficulty of tracing the disease, leading to rapid spread and ...

The use of algorithmic systems raises challenges not only for the specific sector in which they are operated, but also for society as a whole. The right to life, the right to fair trial, the ...

Ask the publishers to restore access to 500,000+ books. An icon used to represent a menu that can be toggled by interacting with this icon. A line drawing of the Internet Archive headquarters building ...