662 search results - page 72 / 133 » Approximate Queries and Representations for Large Data Seque... |
GPC
2007
Springer
14 years 1 months ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
ALT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources — sensor data, experimental data, data from ...
DOLAP
2006
ACM
14 years 1 months ago
2006
ACM
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
VLDB
2006
ACM
14 years 8 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...