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

2011

Highly Cited

2011

We propose to detect abnormal events via a sparse reconstruction over the normal bases. Given an over-complete normal basis set… Expand

Highly Cited

2010

Highly Cited

2010

For a nonnegative irreducible tensor, we give distribution properties of its eigenvalues. In particular, the spectral radius of a… Expand

Highly Cited

2008

Highly Cited

2008

The primary task in any cognitive radio (CR) network is to dynamically explore the radio spectrum and reliably determine portion… Expand

Highly Cited

2003

Highly Cited

2003

The implications of the Minimax theorem are tested using natural data. The tests use a unique data set from penalty kicks in… Expand

Highly Cited

1997

Highly Cited

1997

Suppose nature picks a probability measure P/sub /spl theta// on a complete separable metric space X at random from a measurable… Expand

Highly Cited

1994

Highly Cited

1994

We establish the following theorems: (i) an existence theorem for weak type generalized saddle points; (ii) an existence theorem… Expand

Highly Cited

1989

Highly Cited

1989

In this work, as usual in vector-valued optimization, we consider the partial ordering induced in a topological vector space by a… Expand

1984

1984

Abstract A problem of V. Chvatal is solved. It is proved that if P is a vertically convex lattice polygon with vertical and… Expand

Highly Cited

1978

Highly Cited

1978

This minimax equality was conjectured about a decade ago by one of the authors ([7; page 43], [8], [9]) and, independently, by… Expand

Highly Cited

1952

Highly Cited

1952

Abstract : Kakutani's Fixed Point Theorem states that in Euclidean n-space a closed point to (non-void) convex set map of a… Expand