Approximation - PDFSEARCH.IO - Document Search Engine

Approximation
Results: 2157

#	Item
941	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
942	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics
943	Set 7: Classical & Semi-Classical Oscillators Dipole Approximation • Radiation field Add to Reading List Source URL: background.uchicago.edu Language: English - Date: 2011-12-09 20:36:36 Scattering Thomson scattering Dipole Wavelength Emission spectrum Physics Chemistry Atomic physics
944	Estimating a product of sines using Diophantine approximation Jordan Bell Department of Mathematics, University of Toronto April 3, 2014 Add to Reading List Source URL: individual.utoronto.ca Language: English - Date: 2014-04-03 12:18:40 Measure theory Diophantine approximation Liouville number Measure Meagre set Transcendence theory Transcendental number Sigma-algebra Σ-finite measure Mathematics Mathematical analysis Descriptive set theory
945	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∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:37 Diagrams Discrete geometry Voronoi diagram Triangulation Medial axis Delaunay triangulation Polyhedron Proximity problems Convex hull Geometry Computational geometry Mathematics
946	Proof of convergence Under the assumption that the drift a(·) is Lipschitz, we will show that the approximation L Xt = XNL t + Xt Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2013-11-26 10:22:33 Exponentials Special functions
947	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
948	 Replace the file name, date & time with those for observation (approximation is OK for date & time) in this header part. !!ATTENTION!! - Important convention in OPE file: ANY=PARA1=* PARA2=xxx … Add to Reading List Source URL: subarutelescope.org Language: English - Date: 2012-08-06 14:52:50** Audio engineering Digital signal processing Dither Make Diff Computing Software Unix
949	2-or-more approximation for intuitionistic logic Gabriel Scherer November 25, 2014 1 Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2014-11-25 09:35:48 Algebra Deduction Differential topology Proof theory Abstract algebra Ring theory Semiring
950	IEEE TRANSACTIONS ON ROBOTICS, VOL. 23, NO. 5, OCTOBERApproximate Algorithms for a Collaboratively Controlled Robotic Camera Add to Reading List Source URL: www.ieor.berkeley.edu Language: English - Date: 2007-10-15 15:12:36 Operations research Computational complexity theory Convex optimization Linear programming Approximation algorithm Algorithm Lattice Mathematics Theoretical computer science Applied mathematics

UPDATE