7123 search results - page 1273 / 1425 » The Ordered Set of Rough Sets |
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...