Mini Colloque Hydrodynamique des Lacs et Approximation de st Venant Institut Jean Le Rond D’Alembert http://www.dalembert.upmc.fr/ijlrda/ Lieu : Université Paris VI 4 place JussieuTour 55-65, 5th étage, Salle

Source URL: www.dalembert.upmc.fr

The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. SODA 2012

Source URL: www.math.washington.edu

• Algorithms
• Randomized rounding
• Rounding
• Matrix
• Entropy
• Mathematics
• Computer science
• Applied mathematics

Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer

Source URL: disco.ethz.ch

• Routing
• Approximation algorithm
• Binary trees
• Computing
• Coding theory
• Routing algorithms
• Discrete mathematics

Ab initio path integral molecular dynamics: Basic ideas Dominik Marx and Michele Parrinello Max-Planck-Institut fu¨r Festko¨perforschung, Heisenbergstr. 1, 70569 Stuttgart, Germany ~Received 12 October 1995; accepted 6

Source URL: ftp.theochem.ruhr-uni-bochum.de

• Physics
• Chemistry
• Theoretical chemistry
• Computational chemistry
• Molecular modelling
• Quantum chemistry
• CarParrinello molecular dynamics
• Density functional theory
• Molecular dynamics
• BornOppenheimer approximation
• Path integral formulation
• Fractional quantum mechanics

Adaptive Approximation by Greedy Algorithms Albert Cohen University of Paris VI (France) This talk will discuss computational algorithms that deal with the following general task: given a function f and a dictionary of f

Source URL: math.nyu.edu

CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Mathematics
• Computational complexity theory
• Graph theory
• NP-complete problems
• Operations research
• Travelling salesman problem
• Theoretical computer science
• Approximation algorithm
• Steiner tree problem
• Greedy algorithm
• Optimization problem
• Set cover problem

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Routing algorithms
• Edsger W. Dijkstra
• Combinatorial optimization
• Search algorithms
• Game artificial intelligence
• A* search algorithm
• Shortest path problem
• Flow network
• Tree
• Graph

Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,

Source URL: drops.dagstuhl.de

• Graph theory
• Computational complexity theory
• Mathematics
• NP-complete problems
• Spanning tree
• Steiner tree problem
• Operations research
• Knowledge representation
• Edsger W. Dijkstra
• Minimum spanning tree
• Travelling salesman problem
• Approximation algorithm

arXiv:1011.3159v1 [math.SP] 13 Nov 2010

Source URL: arxiv.org

• Mathematical analysis
• Mathematics
• Orthogonal polynomials
• Approximation theory
• Chebyshev polynomials
• Sequence space
• Limit of a function

Advances in the Minimization of Finite Sums Mark Schmidt Joint work with Nicolas Le Roux, Francis Bach, Reza Babanezhad and Mohamed Ahmed University of British Columbia Context: Minimizing Finite Sums

Source URL: www.proba.jussieu.fr

• Numerical analysis
• Numerical linear algebra
• Stochastic optimization
• Gradient descent
• Support vector machine
• Gradient method
• Operations research
• Mathematical optimization
• Stochastic gradient descent
• Stochastic approximation