6274 search results - page 242 / 1255 » From query complexity to computational complexity |
134
click to vote
IJCGA
2007
15 years 4 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
116
click to vote
AIPS
2006
15 years 6 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
103
click to vote
ANNALS
2006
15 years 4 months ago
2006
This paper describes an interactive simulation of the Electronical Numerical Integrator and Computer (ENIAC). With the simulator, the user can wire up complex configurations of th...
155
click to vote
CBMS
2006
IEEE
15 years 11 months ago
2006
IEEE
— Most biomedical research databases contain considerable amounts of time-oriented data. However, temporal knowledge about the contextual meaning of such data is not usually repr...
164
click to vote
PRIS
2004
15 years 6 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...