Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Source URL: web.stanford.edu

• Mathematics
• Search algorithms
• Information retrieval
• Information science
• Hashing
• Analysis of algorithms
• Cryptographic hash functions
• Computational complexity theory
• Universal hashing
• Hash function
• Randomized algorithm
• Subset sum problem

Outline Big-­O  and  Sorting Lecture   15

Source URL: cs.brown.edu

• Sorting algorithms
• Computer programming
• Software engineering
• Mathematics
• Theoretical computer science
• Procedural programming languages
• Merge sort
• Recursion
• Best
• worst and average case
• Algorithm
• ALGOL 68
• Sort

Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Analysis of algorithms
• Operations research
• Scheduling
• Algorithm
• Mathematical logic
• Theoretical computer science
• Time complexity
• NC
• Job shop scheduling

Procedings of 13th International Conference on Intelligent Autonomous Systems (IAS), Padova, Italy, JulyContinuous Motion Planning for Service Robots with Multiresolution in Time Ricarda Steffens, Matthias Nieuwe

Source URL: www.ais.uni-bonn.de

• Robot kinematics
• Search algorithms
• Mathematical optimization
• Engineering
• Aerodynamics
• Aerospace engineering
• Trajectory optimization
• Applied mathematics
• Mathematics
• Motion planning
• Robotics
• Kinematics

Screen Space Ambient Occlusion for Non-Photorealistic Rendering Brett Lajzer Rensselaer Polytechnic Institute a)

Source URL: www.cs.rpi.edu

• 3D computer graphics
• Computer graphics
• Shading
• Global illumination algorithms
• 3D rendering
• Virtual reality
• Screen space ambient occlusion
• Ambient occlusion
• Cel shading
• Texture mapping
• Rendering
• OpenGL

Computer Vision Lab Project Description Description of the project, how the application should work, what is the user input, the expected output, etc. Describe the user interface, the computer vision algorithms

Source URL: www.cvg.ethz.ch

XIDEAL Gr¨ obner Bases for Exterior Algebra David Hartley ∗† Institute for Algorithms and Scientific Computing GMD — German National Research Center

Source URL: reduce-algebra.com

• Algebra
• Mathematics
• Abstract algebra
• Ring theory
• Polynomials
• Algebraic geometry
• Commutative algebra
• Multilinear algebra
• Exterior algebra
• Homogeneous polynomial
• Graded
• Ring

Extended Analysis based on the SPES Architecture Meta-Model

Source URL: spes2020.informatik.tu-muenchen.de

• Engineering
• Technology
• Computing
• Programming paradigms
• Real-time computing
• Scheduling algorithms
• Abstraction
• Data management
• Systems engineering
• Object Process Methodology
• Worst-case execution time
• Scheduling

The Cost of Unknown Diameter in Dynamic Networks Haifeng Yu Yuda Zhao

Source URL: www.comp.nus.edu.sg

• Leader election
• Networks
• Network theory
• Computer programming
• Mathematics
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Computing

Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

Source URL: www-tcs.cs.uni-sb.de

• Mathematics
• Graph theory
• Matching
• Discrete mathematics
• Combinatorics
• Cooperative games
• Game theory
• Combinatorial optimization
• Stable marriage problem
• Stable roommates problem
• 3-dimensional matching