8298 search results - page 181 / 1660 » On the Complexity of Numerical Analysis |
202
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
195
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Numerous microarray analysis programs have been created through the efforts of Open Source software development projects. Providing browser-based interfaces that allow...
214
Voted
RTA
2010
Springer
15 years 11 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
174
click to vote
ESEM
2008
ACM
15 years 8 months ago
2008
ACM
Complexity is often hypothesized to be the enemy of software security. If this hypothesis is true, complexity metrics may be used to predict the locale of security problems and ca...
182
click to vote
JC
1998
15 years 6 months ago
1998
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...