 About 724,000 results  books.google.com Is f a linear function? Are the spaces S and S' of exercise 28 isomorphic? Give an
example of a nearlinear space with both finite and infinite lines. Find two infinite
nearlinear spaces which are isomorphic. Show that if S and S' are nearlinear ... 

 books.google.com In this section we shall consider the theory of rindependence in relation to a
number of sets S provided with various structures. The firat few examples are
nearlinear spaces (or partial planes, using the terminology of Hall [16]). These
are sets ... 

 books.google.com We present an algorithm whose space usage is Θ(n) whereas existing algorithms
use Θ(n2) space, while being only a ... The method used to achieve this consists
of two parts: a framework that uses linear space and nearlinear time, and a ... 

 books.google.com A nearlinear space is a structure with two kinds of elements, 'points' and 'lines',
and a symmetric binary relation of 'incidence' relating points and lines in such a
way that (i) any line is incident with at least two points, and (ii) any two distinct ... 

 books.google.com A small eigenvalue and a near exact linear dependency among the columns of X
is associated with each large ... Since the J corresponding eigenvectors span the
space containing the coefficients of the true linear dependence, the “50 percent ... 

 books.google.com Takao Asano, Shin ichi Nakano, Yoshio Okamoto  2011  Preview For exact range medians in constant time, there have been several iterations of
nearquadratic space data structures [15,18,19]. For linear space data structures,
Gfeller and Sanders [8] showed that range median queries could be supported in
... 

 books.google.com ... the linear spaces from linear algebra). More generally, a partial linear space or
nearlinear space [see L. Batten (1986)] is a set X (of points) together with a set L
of subsets of X (called lines) such that two points are joined by at most one line. 

 books.google.com This is currently the most efficient linearspace solution to this problem. Succinct
data structures are also extensively used in the design of data structures
occupying linear or nearlinear space for dynamic range median [46], range
majority [33], ... 

 books.google.com has a linearspace solution with constant query time. ... AC0 dictionary of
Andersson et al. has query time n I log w • max{ log log log n  log log log w, l } /
logn 1 \ log log w ' log logn and uses linear or nearlinear space (a linear space
bound 81. 

 books.google.com This was subsequently improved to O(n2/logn) space in [3] and finally to O(n2
loglogn/log 2 n) in [4]. ... We suspect that the actual lower bound for nearlinear
space data structures for the range mode problem is significantly larger. However
a ... 

 