2509 search results - page 121 / 502 » Abstract Geometrical Computation and Computable Analysis |
83
Voted
ICCS
2005
Springer
15 years 6 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...
93
Voted
FPCA
1989
15 years 4 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...
117
click to vote
ACCV
2007
Springer
15 years 4 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...
116
click to vote
RTA
2010
Springer
15 years 4 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...
FIDJI
2004
Springer
15 years 4 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 ...