Approximation

Results: 2157



#Item
191Mathematical analysis / Mathematics / Numerical integration / Orthogonal polynomials / ClenshawCurtis quadrature / Approximation theory / Fourier analysis / Exponentiation / Chebyshev polynomials / Bessel function

Introduction to Numerical Analysis Spring 2016 Problem Set 9 Solutions Problem 1. Consider the integral Z

Add to Reading List

Source URL: homerreid.dyndns.org

Language: English - Date: 2016-04-27 10:48:23
192Mathematics / Mathematical analysis / Diophantine approximation / Low-discrepancy sequence / Numerical analysis / Quasirandomness / Random number generation / Ring / Permutation / Maximum disjoint set / Permutation polynomial

From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2002-03-01 16:04:01
193Linear algebra / Mathematics / Matrix / Norm

Norms of random submatrices and sparse approximation Joel A. Tropp 1 Applied & Computational Mathematics, California Institute of Technology, Pasadena, CAReceived *****; accepted after revision +++++ Present

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2008-07-28 20:32:09
194Mathematics / Statistics / Applied mathematics / Data mining / Search algorithms / Approximation algorithms / Discrete geometry / Nearest neighbor search / Numerical analysis / Hierarchical clustering / Cluster analysis / K-means clustering

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
195Economy / Money / Finance / Banking / Personal finance / Financial services / Credit / Interest rates / Credit card / Representative example / Annual percentage rate / Consumer protection

COUNCIL DIRECTIVE of 22 December 1986 for the approximation of the laws, regulations and administrative provisions of the Member States concerning consumer creditEEC) THE COUNCIL OF THE EUROPEAN COMMUNITIES,

Add to Reading List

Source URL: www.fecma.eu

Language: English - Date: 2015-02-20 09:24:24
196Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Packing problems / Operations research / Approximation algorithms / Knapsack problem / Vertex cover / Bin packing problem / Hardness of approximation / Algorithm

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

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

Language: English - Date: 2014-06-04 08:46:15
197Mathematics / Abstract algebra / Mathematical analysis / Modular forms / Operator theory / Joachim Cuntz / Hertrich / Cyclic homology / Modular curve / Crossed product

Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung Band 2, 1997 A. Bottcher On the Approximation Numbers of Large Toeplitz Matrices

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-07-15 07:16:38
198Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Set cover problem / Approximation algorithm / Algorithm / Analysis of algorithms / Bin packing problem / Vertex cover

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Add to Reading List

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

Language: English - Date: 2013-03-13 08:17:47
199Mathematics / Mathematical analysis / Mathematical induction / Integer sequences / Approximation theory / Mathematical series / Binomial coefficient / Aurifeuillean factorization

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 skipped

Add to Reading List

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

Language: English - Date: 2016-03-04 12:26:59
200Computational complexity theory / Graph theory / NP-complete problems / Mathematics / Travelling salesman problem / Set TSP problem / Steiner tree problem / Vertex cover / Approximation algorithm / APX / Cut / Time complexity

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

Add to Reading List

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

Language: English - Date: 2014-11-26 08:32:22
UPDATE