1089 search results - page 90 / 218 » Bounds on generalized Frobenius numbers |
COLOGNETWENTE
2010
13 years 7 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
FLAIRS
2004
13 years 10 months ago
2004
We present a single-layer recurrent neural network that implements novelty detection for spatiotemporal patterns. The architecture is based on the structure of region CA3 in the h...
CCCG
1998
13 years 10 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...