Skip to search formSkip to main content

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

2010

Highly Cited

2010

A modularity-specialized label propagation algorithm (LPAm) for detecting network communities was recently proposed. This… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

KL approximation of a possibly instationary random field a(ω, x) ∈ L2(Ω,dP; L∞(D)) subject to prescribed meanfield Ea(x) = ∫Ω, a… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Let ψ be a 2-DNF formula on boolean variables x1,...,xn ∈ {0,1}. We present a homomorphic public key encryption scheme that… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Block copolymers are the focus of a great deal of research activity in contemporary macromolecular science. This is attributable… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

In this study, a matrix method called the Taylor collocation method is presented for numerically solving the linear integro… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We present a randomized polynomial time algorithm to determine if a multivariate polynomial is zero using <italic>O(\log mn… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Surgery, as developed by Browder, Kervaire, Milnor, Novikov, Sullivan, Wall and others is a method for comparing homotopy types… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

Amphiphilic molecules are renowned for their ability to partition chemically immiscible components into nanoscale domains. Often… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

Every boolean function may be represented as a real polynomial. In this paper we characterize the degree of this polynomial in… Expand

Is this relevant?

Highly Cited

1980

Highly Cited

1980

An investigation of the single-vehicle, many-to-many, immediate-request dial-a-ride problem is developed in two parts I and II… Expand

Is this relevant?