4438 search results - page 399 / 888 » Speculative Query Processing |
205
Voted
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
236
click to vote
PET
2010
Springer
15 years 9 months ago
2010
Springer
Mobile smartphone users frequently need to search for nearby points of interest from a location based service, but in a way that preserves the privacy of the users' locations...
251
click to vote
ER
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
274
click to vote
BMCBI
2004
15 years 7 months ago
2004
Background: Once specific genes are identified through high throughput genomics technologies there is a need to sort the final gene list to a manageable size for validation studie...
276
click to vote
SSD
2007
Springer
16 years 1 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 ...