2509 search results - page 121 / 502 » Abstract Geometrical Computation and Computable Analysis |
139
click to vote
ICCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We describe, devise, and augment dynamic data-driven application simulations (DDDAS). DDDAS offers interesting computational and mathematically unsolved problems. In thi...
148
click to vote
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
199
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Compared with the color histogram, where the position information of each pixel is ignored, a simplified color correlogram (SCC) representation encodes the spatial inform...
172
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
165
click to vote
FIDJI
2004
Springer
15 years 10 months ago
2004
Springer
Our paper aims at proposing a framework that allows programmers to exploit the benefits of exception handling throughout the entire development Java programs by modeling exception ...