Results 61 to 70 of about 1,533,628 (86)
Efficient Algorithms to Globally Balance a Binary Search Tree
, 1984 A binary search tree can be globally balanced by readjustment of pointers or with a sorting process in O(n) time, n being the total number of nodes.
H. Chang, S. Iyengar
core
Approximation Algorithms for Network Design and Orienteering [PDF]
, 2010 Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-07-16T16:48:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No.
Korula, Nitish J.
core
Towards Understanding First Order Algorithms for Nonconvex Optimization in Machine Learning
, 2019 Presented on February 11, 2019 at 11:00 a.m. as part of the ARC12 Distinguished Lecture in the Klaus Advanced Computing Building, Room 1116.Tuo Zhao is an assistant professor in the H.
Zhao, Tuo
core
Algorithms for space partitioning under constraints on geolocated attributes
, 2022 reservedThe present thesis work aims to study the problem of space partitioning under some constraints on geolacated attributes through the development and evaluation of specific ...
ROSSI, EDDIE
core
Recursive Algorithms for the Representation of Parametric Curves and Surfaces
, 1985 includes a short bibliography. Recursive algorithms for the representation of parametric curves and surfaces are presented which are based upon a geometric property of the de Casteljau algorithm.
L. Piegl
core
The Art of Computer Programming: Fundamental algorithms
, 1973 -- This vol. is part of 7 vol. set. CADLINE has vol.1 and 3. Introduces basic concept in algorithms and information structure with exercises.
Knuth, Donald E., D. Knuth
core
Fast Approximation Algorithms and Complexity Analysis for Design of Networked Systems
, 2019 Presented on November 18, 2019 at 11:00 a.m. in the Klaus Advanced Computing Building, Room 1116E.Yuhao Yi is a postdoctoral researcher in Computer Science at Rensselaer Polytechnic Institute (RPI).
Yi, Yuhao
core
, 1982 Nonlinear, local and highly parallel algorithms can perform several simple but important visual computations. Specific classes of algorithms can be considered in an abstract way.
Poggio, Tomaso
core
Games have long been benchmarks for AI algorithms and, with the boost of computational power and the application of new algorithms, AI systems have achieved superhuman performance in games for which it was once thought that they could only be mastered by
Wenxin Li, Haifeng Zhang
core +1 more source
Analyzing the performance of sequential and parallel algorithms
This undergraduate thesis explores the intricate world of sequential and parallel algorithms, which are fundamental to problem-solving and computational efficiency in computer science and information technology.
Mahmoud, Omar Hosny Mohamed
core