Skip to search formSkip to main contentSkip to account menu

Approximation-preserving reduction

In computability theory and computational complexity theory, especially the study of approximation algorithms, an approximation-preserving reduction… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we present a new and effective dimensionality reduction method called locality sparsity preserving projections… 
2015
2015
Many recent methods for perspective shape from shading (SfS) are based on formulations in terms of partial differential equations… 
2013
2013
Sparsity Preserving Projection(SPP)is a new algorithm for reducing dimensions of dataset based on a weighted graph(l1-Graph… 
2012
2012
Recently, there has been a lot of interest in the underlying sparse representation structure in high-dimensional data such as… 
2009
2009
We improve results of Belair, Macintyre, and Scanlon on valued fields with a valuation preserving automorphism by weakening their… 
2007
2007
In this paper, we consider the problem of compositing a scene from multiple images. Multiple images, for example, can be obtained… 
2007
2007
In general, for higher order elliptic equations and boundary value problems like the biharmonic equation and the linear clamped… 
2003
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute… 
1994
1994
We study the longstanding problem of semantics for input/output (I/O) expressed using side-effects. Our vehicle is a small higher…