Results 41 to 50 of about 2,688,255 (145)

The algorithm designer project : a visual programming environment for data structure demonstration [PDF]

, 1999
Previous work on pedagogical tools for teaching students algorithms has focused on high level animations of the algorithms. This dissertation describes a tool that gives instructors the ability to pictorially demonstrate the implementation of algorithms ...
Brown, David Randall
core   +1 more source

A Smoothing Algorithm for the Dual Marching Tetrahedra Method [PDF]

, 2011
: The Dual Marching Tetrahedra algorithm is a generalization of the Dual Marching Cubes algorithm, used to build a boundary surface around points which have been assigned a particular scalar density value, such as the data produced by and Magnetic ...

core  

Producción y uso de vídeo-ejercicios didácticos en asignaturas de programación [PDF]

, 2012
Este artículo describe los resultados de la producción e incorporación de vídeo-ejercicios didácticos en las asignaturas Introducción a la Informática y a la Programación (IIP), Programación (PRG) y Estructuras de Datos y Algoritmos (EDA) en el Grado
Moltó, Germán
core  

Informatics and Natural Computation: Final Report [PDF]

, 2010
The purpose of this grant is to develop an interdisciplinary course in Informatics and Natural Computation that would service undergraduate computer, natural, and physical science majors.
Marchese, Francis T.
core   +1 more source

Learning to Predict Combinatorial Structures [PDF]

, 2009
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space.
Vembu, Shankar
core   +1 more source

Bregman proximity search [PDF]

, 2009
In this dissertation, we study efficient solutions to proximity search problems where the notion of proximity is defined by a bregman divergence. Proximity search tasks are at the core of many machine learning algorithms and are a fundamental research ...
Cayton, Lawrence
core  

Notes on Randomized Algorithms

, 2020
Lecture notes for the Yale Computer Science course CPSC 469/569 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms.
Aspnes, James
core  

An Algorithmic Approach to the 15-Minute City [PDF]

openThe 15-Minute City is an urban planning concept introduced in the last decade that promotes accessibility. It emphasizes that residents should be able to meet basic needs—such as groceries, education, healthcare, and leisure—within a 15-minute travel
LAM, HOU CHENG
core  

Ten quick tips to perform meaningful and reproducible molecular docking calculations. [PDF]

PLoS Comput Biol
Martis EAF, Téletchéa S.
europepmc   +1 more source

Research on target detection based on improved YOLOv7 in complex traffic scenarios. [PDF]

PLoS One
Liu Y, Zhou H, Zhao M.
europepmc   +1 more source