1331 search results - page 196 / 267 » Complexity bounds for zero-test algorithms |
115
click to vote
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
128
click to vote
FMCAD
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we demonstrate a potential extension of formal verification methodology in order to deal with time-domain properties of analog and mixed-signal circuits whose dynamic...
121
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Meta-level control manages the allocation of limited resources to deliberative actions. This paper discusses efforts in adding meta-level control capabilities to a Markov Decision...
126
click to vote
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
136
click to vote
DCG
2008
15 years 3 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...