Sciweavers

1146 search results - page 32 / 230
» Finite cupping sets
Sort
View
EWC
2000
106views more  EWC 2000»
13 years 7 months ago
Object Oriented Tools for Scientific Computing
A set of object oriented tools is presented which, when combined, yield an efficient parallel finite element program. Special emphasis is given to details within the concept of the...
Philippe R. B. Devloo
MOC
2000
91views more  MOC 2000»
13 years 7 months ago
A parallel method for time-discretization of parabolic problems based on contour integral representation and quadrature
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
Dongwoo Sheen, Ian H. Sloan, Vidar Thomée
DCC
2008
IEEE
14 years 7 months ago
On the graph of a function in many variables over a finite field
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
Simeon Ball
APAL
1998
71views more  APAL 1998»
13 years 7 months ago
On the Finiteness of the Recursive Chromatic Number
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
William I. Gasarch, Andrew C. Y. Lee
APPML
2008
50views more  APPML 2008»
13 years 7 months ago
Block realizations of finite metrics and the tight-span construction I: The embedding theorem
Given a finite set X and a proper metric D : X
Andreas W. M. Dress, Katharina T. Huber, Jacobus H...