19320 search results - page 62 / 3864 » On the complexity of computing determinants |
ESANN
2006
14 years 11 months ago
2006
In this paper, the problem of an optimal transformation of the input space for function approximation problems is addressed. The transformation is defined determining the Mahalanob...
TCS
2008
14 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
COLING
2002
14 years 9 months ago
2002
In this paper we show to what degree the countability of English nouns is predictable from their semantics. We found that at 78% of nouns' countability could be predicted usi...
RTSS
2007
IEEE
15 years 4 months ago
2007
IEEE
Creating robust real-time embedded software is critical in combining the physical world with computing, such as in consumer electronics or robotics. One challenge is the complexit...
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...