Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation [PDF]
, 2018 In a probabilistic context, the main data structures of computer science are viewed as random combinatorial objects. Analytic Combinatorics, as described in the book by Flajolet and Sedgewick, provides a set of high-level tools for their probabilistic
Salvy, Bruno
core +3 more sources
A Direct Manipulation Language for Explaining Algorithms [PDF]
, 2014 Instructors typically explain algorithms in computer science by tracing their behavior, often on blackboards, sometimes with algorithm visualizations.
Davis, Randall +2 more
core +1 more source
Curriculum Guidelines for Undergraduate Programs in Data Science [PDF]
, 2017 The Park City Math Institute (PCMI) 2016 Summer Undergraduate Faculty Program met for the purpose of composing guidelines for undergraduate programs in Data Science.
Agarwal, Mahesh +24 more
core +3 more sources
Chemoinformatics Research at the University of Sheffield: A History and Citation Analysis [PDF]
, 2003 This paper reviews the work of the Chemoinformatics Research Group in the Department of Information Studies at the University of Sheffield, focusing particularly on the work carried out in the period 1985-2002.
Bishop, N. +3 more
core +1 more source
On the enumeration of closures and environments with an application to random generation [PDF]
, 2019 Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables.
Bendkowski, Maciej, Lescanne, Pierre
core +3 more sources
Symbolic and analytic techniques for resource analysis of Java bytecode [PDF]
, 2010 Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap shapes, in the tradition of separation logic, and assertions about ...
Aspinall, David +3 more
core +3 more sources
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class [PDF]
, 2018 We develop a framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world networks) while still ...
Demaine, Erik D. +7 more
core +2 more sources
Universal Compressed Text Indexing [PDF]
, 2018 The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes based on dictionary compression, a rich and heterogeneous family that exploits text repetitions in different ways. For each such compression scheme, several
Navarro, Gonzalo, Prezza, Nicola
core +2 more sources
Evolving structure-function mappings in cognitive neuroscience using genetic programming [PDF]
, 2005 A challenging goal of psychology and neuroscience is to map cognitive functions onto neuroanatomical structures. This paper shows how computational methods based upon evolutionary algorithms can facilitate the search for satisfactory mappings by ...
Gobet, F, Parker, A
core +1 more source
Сравнение сложность алгоритмов вставкой и быстрой сортировки [PDF]
, 2014 A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order.
Чан Тхюи Зунг
core