2333 search results - page 270 / 467 » Recursive Computational Depth |
200
click to vote
WG
2005
Springer
16 years 17 days ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
181
click to vote
GG
2004
Springer
16 years 14 days ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
199
click to vote
PARA
2004
Springer
16 years 13 days ago
2004
Springer
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
204
click to vote
RTA
2004
Springer
16 years 13 days ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
164
click to vote
IPPS
2003
IEEE
16 years 11 days ago
2003
IEEE
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...