Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2009

Highly Cited

2009

SINGULAR is a specialized computer algebra system for polynomial computations with emphasize on the needs of commutative algebra… Expand

Highly Cited

2008

Highly Cited

2008

Abstract Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations… Expand

Highly Cited

2002

Highly Cited

2002

We present a new method for solving stochastic differential equations based on Galerkin projections and extensions of Wiener's… Expand

Highly Cited

2001

Highly Cited

2001

In this paper we present a new form of texture mapping that produces increased photorealism. Coefficients of a biquadratic… Expand

Highly Cited

1999

Highly Cited

1999

We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d ‘Oblivious… Expand

Highly Cited

1994

Highly Cited

1994

Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path… Expand

Highly Cited

1988

Highly Cited

1988

Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network. The constraint on… Expand

Highly Cited

1984

Highly Cited

1984

We present a new polynomial-time algorithm for linear programming. The running-time of this algorithm is <italic>O</italic… Expand

Highly Cited

1980

Highly Cited

1980

The s tar thng success o f the Rabm-S t ra s sen -So lovay p n m a h t y algori thm, together wi th the intr iguing foundat tonal… Expand

Highly Cited

1971

Highly Cited

1971

A complex multidimensional decision hypersurface can be approximated by a set of polynomials in the input signals (properties… Expand