4110 search results - page 806 / 822 » Efficient algorithms for the 2-gathering problem |
SIGMOD
2007
ACM
14 years 6 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
EDBT
2008
ACM
14 years 6 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
IUI
2009
ACM
14 years 3 months ago
2009
ACM
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
DSRT
2008
IEEE
14 years 1 months ago
2008
IEEE
In the past decade parallel disk systems have been highly scalable and able to alleviate the problem of disk I/O bottleneck, thereby being widely used to support a wide range of d...
SSD
2007
Springer
14 years 25 days 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 ...