Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi

Source URL: www.cs.technion.ac.il

• NP-complete problems
• Analysis of algorithms
• Parameterized complexity
• Graph coloring
• Kernelization
• Dominating set
• Vertex cover
• Time complexity
• Steiner tree problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Weak sense Lp error bounds for leader–node distributed particle filters Boris N. Oreshkin and Mark Coates Department of Electrical and Computer Engineering McGill University Montreal, Canada

Source URL: www.tsp.ece.mcgill.ca

• Control theory
• Electronic engineering
• Monte Carlo methods
• Linear filters
• Signal processing
• Particle filter
• Kalman filter
• Approximation algorithm
• Robot control
• Statistics
• Estimation theory

PDF Document

Source URL: www.jimal-khalili.com

• Particle physics
• Eikonal approximation
• Mathematical analysis
• Darmstadtium
• Cross section
• Electron
• Nuclear fusion
• Physics
• Scattering
• Nuclear physics

A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in

Source URL: www.mit.edu

• NP-complete problems
• Matroid theory
• Spanning tree
• Signed graph
• Graph
• Clique
• Tree
• Combinatorial optimization
• Eulerian path
• Graph theory
• Theoretical computer science
• Mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗

Source URL: cccg.ca

• NP-complete problems
• Operations research
• Approximation algorithm
• Travelling salesman problem
• APX
• Steiner tree problem
• Algorithm
• Set cover problem
• Reduction
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm Joachim Giesen∗

Source URL: cccg.ca

• Diagrams
• Discrete geometry
• Voronoi diagram
• Triangulation
• Medial axis
• Delaunay triangulation
• Polyhedron
• Proximity problems
• Convex hull
• Geometry
• Computational geometry
• Mathematics

Non-clairvoyant Scheduling of Multiple Bag-of-tasks Applications Henri Casanova1 , Matthieu Gallet2,3 , and Fr´ed´eric Vivien3,1,2 1 2

Source URL: navet.ics.hawaii.edu

• Mathematics
• Throughput
• Approximation algorithm
• Job shop scheduling
• Mathematical optimization
• Scheduling
• Algorithm
• Operations research
• Applied mathematics
• Theoretical computer science

There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract

Source URL: www.cs.technion.ac.il

• Dynamic programming
• Operations research
• Complexity classes
• Approximation algorithms
• Polynomial-time approximation scheme
• Knapsack problem
• Subset sum problem
• Parameterized complexity
• Optimization problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Fault Tolerant Clustering Revisited Nirman Kumar∗ Abstract

Source URL: www.cccg.ca

• Approximation algorithms
• Computational complexity theory
• Cluster analysis
• Data mining
• Geostatistics
• K-means clustering
• K-medians clustering
• Metric k-center
• Algorithm
• Mathematics
• Theoretical computer science
• Statistics

1. Questions de cours (a) Donner la signature de la forme quadratique : xy + xz + xt + yz + yt + zt. (b) Existence de bases orthonormales en dimension finie (c) Meilleure approximation par un vecteur de F (d) Orthonormal

Source URL: www.bibmath.net