1813 search results - page 344 / 363 » Calculi of Approximation Spaces |
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
109
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
103
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
ICS
2010
Tsinghua U.
15 years 4 months ago
2010
Tsinghua U.
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...