3108 search results - page 147 / 622 » The Elements of Computer Credibility |
130
click to vote
EWC
2008
15 years 5 months ago
2008
The pre-processing stage of finite element analysis of the Navier-Stokes equations is becoming increasingly important as the desire for more general boundary conditions, as well a...
156
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
129
click to vote
CIE
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial 0 1 class with no...
140
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
142
Voted
DLOG
2009
15 years 2 months ago
2009
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...