3108 search results - page 80 / 622 » The Elements of Computer Credibility |
137
click to vote
LSSC
2007
Springer
15 years 10 months ago
2007
Springer
A successive refinement of a finite element grid provides a sequence of nested grids and hierarchy of nested finite element spaces as well as a natural hierarchical decompositio...
110
click to vote
MFCS
1993
Springer
15 years 8 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
103
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
123
click to vote
MCS
2007
Springer
15 years 4 months ago
2007
Springer
Most results related to discrete nonnegativity conservation principles (DNCP) for elliptic problems are limited to finite differences (FDM) and lowest-order finite element meth...
143
click to vote
TCS
2010
15 years 2 months ago
2010
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...