464 search results - page 30 / 93 » Subsystem Based Generalizations of Rough Set Approximations |
SAS
2001
Springer
15 years 1 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
CIKM
2003
Springer
15 years 2 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
CVPR
2010
IEEE
14 years 8 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...