Sciweavers

4886 search results - page 75 / 978
» Approximate Data Exchange
Sort
View
RSFDGRC
2005
Springer
133views Data Mining» more  RSFDGRC 2005»
15 years 10 months ago
Rough Set Approximation Based on Dynamic Granulation
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Ju...
MOC
1998
111views more  MOC 1998»
15 years 4 months ago
The approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
David Levin
155
Voted
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 10 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
RSFDGRC
2005
Springer
126views Data Mining» more  RSFDGRC 2005»
15 years 10 months ago
Rough Sets and Higher Order Vagueness
Abstract. We present a rough set approach to vague concept approximation within the adaptive learning framework. In particular, the role of extensions of approximation spaces in se...
Andrzej Skowron, Roman W. Swiniarski
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 4 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount