511 search results - page 9 / 103 » Approximate Selection Queries over Imprecise Data |
VLDB
2007
ACM
14 years 11 months ago
2007
ACM
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- A large amount of the world's data is both sequential and imprecise. Such data is commonly modeled as Markovian streams; examples include words/sentences inferred f...
CORR
1999
Springer
13 years 10 months ago
1999
Springer
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...
AIPS
2009
13 years 12 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...