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
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
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
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
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
Сравнение сложность алгоритмов вставкой и быстрой сортировки [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
On Vector Fitting methods in signal/power integrity applications [PDF]
, 2010 This conference proceedings appears in: Lecture Notes in Engineering and Computer Science. Open-access online version: http://www.iaeng.org/publication/IMECS2010/Vector Fitting (VF) has been applied to reformulate traditional system identification ...
Chen, Q, Lei, CU, Wang, Y, Wong, N
core
Prospects and limitations of full-text index structures in genome analysis [PDF]
, 2012 The combination of incessant advances in sequencing technology producing large amounts of data and innovative bioinformatics approaches, designed to cope with this data flood, has led to new interesting results in the life sciences.
Dawyndt, Peter +3 more
core +2 more sources
Hatékony algoritmusok = Efficient algorithms [PDF]
, 2007 A kutatás során csoportunk egy sor új eredményt ért el a számítástudomány több területén. Ezek a területek: algebrai és szimbolikus számítások, számításelmélet, kombinatorikus optimalizálás, adatbázis-elmélet, adatbányászat és internetes ...
Benczúr, András +10 more
core