PHYSICS OF PLASMAS 14, 102112 共2007兲 A unified approach to the Darwin approximation Todd B. Krause Institute for Fusion Studies and Physics Department, The University of Texas at Austin, Austin, Texas 78712, USA

Source URL: home.icts.res.in

• Electromagnetism
• Statistical mechanics
• Classical mechanics
• Lorentz force
• Hamiltonian
• Lagrangian
• Equations of motion
• Differential equation
• Vlasov equation

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

Source URL: vigna.di.unimi.it

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP-complete problems
• Mathematical optimization
• NP-hard problems
• MAX-3SAT
• NP
• Approximation algorithm
• Probabilistically checkable proof
• PCP theorem
• APX

Approximation via Correlation Decay when Strong Spatial Mixing Fails Ivona Bez´akov´a∗ Andreas Galanis† Leslie Ann Goldberg†

Source URL: pages.cs.wisc.edu

Stream Clustering: Efficient Kernel-based Approximation using Importance Sampling Radha Chitta, Rong Jin and Anil K. Jain Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824,

Source URL: www.cse.msu.edu

PROBLEM FIELD: APPROXIMATION OF FRAMES BY NORMALIZED TIGHT ONES MICHAEL FRANK Let {xi }i be a frame of a Hilbert subspace K ⊆ H of a given (separable) Hilbert space H with upper and lower frame bounds B and A. The resu

Source URL: www.imn.htwk-leipzig.de

Einleitung Eine deterministische Approximation von #RUCKSACK Ein FPRASC für #RUCKSACK Approximate Counting Ein FPRASC für #RUCKSACK

Source URL: octo.it

First order schemes in the numerical quantization method V. Bally∗, G. Pag`es† and J. Printems‡ Abstract The numerical quantization method is a grid method which relies on the approximation of the solution of a non

Source URL: perso-math.univ-mlv.fr

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar

Source URL: www.cs.rpi.edu

• Matching
• Combinatorics
• NP-complete problems
• Combinatorial optimization
• Spanning tree
• Stable marriage problem
• Approximation algorithm
• 3-dimensional matching
• Minimum spanning tree

Dynamic Texture Recognition via Orthogonal Tensor Dictionary Learning Yuhui Quan1 , Yan Huang2 , Hui Ji1 1 2

Source URL: www.cv-foundation.org

• Algebra
• Linear algebra
• Mathematics
• Machine learning
• Numerical linear algebra
• Signal processing
• Sparse dictionary learning
• Unsupervised learning
• Sparse approximation
• Feature learning
• K-SVD
• Support vector machine