734 search results - page 69 / 147 » Efficient join processing over uncertain data |
AIPS
2004
14 years 11 months ago
2004
In a market-based scheduling mechanism, the allocation of time-specific resources to tasks is governed by a competitive bidding process. Agents bidding for multiple, separately al...
DOLAP
2006
ACM
15 years 3 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...
118
click to vote
CBMS
2002
IEEE
15 years 2 months ago
2002
IEEE
The need for systems that can stock, represent, and provide efficient retrieval facilities of images of particular interest is becoming very high in medicine. In this respect, a l...
PAISI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
158
click to vote
VLDB
2002
ACM
15 years 10 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...