220 search results - page 18 / 44 » tcs 2008 |
TCS
2008
13 years 9 months ago
2008
The aim of this paper is to show that the supercover of an m-flat (i.e. a Euclidean affine subspace of dimension m) in Euclidean n-space is a discrete analytical object. The super...
TCS
2008
13 years 9 months ago
2008
In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices gener...
TCS
2008
13 years 9 months ago
2008
We apply our recent preconditioning techniques to the solution of linear systems of equations and computing determinants. We combine these techniques with the Sherman
TCS
2002
13 years 9 months ago
2002
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
TCS
2002
13 years 9 months ago
2002
We de ne an in nite array A of nonnegative integers based on a linear recurrence, whose second row provides basis elements of an exotic ternary numeration system. Using the numerat...