1813 search results - page 86 / 363 » Calculi of Approximation Spaces |
145
click to vote
GIS
1999
ACM
15 years 10 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
181
click to vote
DOLAP
2005
ACM
15 years 8 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
164
click to vote
JUCS
2008
15 years 6 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
192
click to vote
JMLR
2010
15 years 4 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
194
click to vote
EDBT
2002
ACM
16 years 6 months ago
2002
ACM
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...