734 search results - page 67 / 147 » Efficient join processing over uncertain data |
113
click to vote
SIGMOD
2011
ACM
14 years 19 days ago
2011
ACM
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
SOSP
2001
ACM
15 years 6 months ago
2001
ACM
In most distributed systems, naming of nodes for low-level communication leveragestopologicallocation(such as node addresses) and is independentof any application. In this paper, ...
136
click to vote
SSD
2007
Springer
15 years 4 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
PAMI
2006
14 years 9 months ago
2006
Gaussian process classifiers (GPCs) are Bayesian probabilistic kernel classifiers. In GPCs, the probability of belonging to a certain class at an input location is monotonically re...
DAWAK
2000
Springer
15 years 2 months ago
2000
Springer
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...