In computability theory and computational complexity theory, especially the study of approximation algorithms, an approximation-preserving reductionâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- Yuhua Qian, Jiye Liang, Deyu Li, Feng Wang, Nannan Ma
- Knowl.-Based Syst.
- 2010

0950-7051/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.knosys.2010.02.004 * Corresponding author. Address: Keyâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Jianwei Ma, Gerlind Plonka-Hoch
- IEEE Transactions on Image Processing
- 2007

In this paper, a diffusion-based curvelet shrinkage is proposed for discontinuity-preserving denoising using a combination of aâ€¦Â (More)

Is this relevant?

2007

Highly Cited

2006

Highly Cited

2006

- Noga Alon
- SIAM J. Discrete Math.
- 2006

A tournament is an oriented complete graph. The feedback arc set problem for tournaments is the optimization problem ofâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Xiaofei He, Deng Cai, Shuicheng Yan, HongJiang Zhang
- Tenth IEEE International Conference on Computerâ€¦
- 2005

Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. Weâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Lorenzo Pareschi, Giovanni Russo
- J. Sci. Comput.
- 2005

We consider implicit-explicit (IMEX) Runge Kutta methods for hyperbolic systems of conservation laws with stiff relaxation termsâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Stavros G. Kolliopoulos, Clifford Stein
- FOCS
- 1997

In the single-source unsplittable ow problem we are given a graph G; a source vertex s and a set of sinks t 1 ; : : :; t k withâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
- SIAM J. Comput.
- 1996

The study of the approximability properties of NP-hard optimization problems has recently made great advances mainly due to theâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

The error backpropagation learning algorithm (BP) is generally considered biologically implausible because it does not useâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Leslie G. Valiant, Vijay V. Vazirani
- STOC
- 1985

For all known NP-complete problems the number of solutions in instances having solutions may vary over an exponentially largeâ€¦Â (More)

Is this relevant?