137 search results - page 24 / 28 » Efficient Processing of Top-k Spatial Preference Queries |
ARCS
2004
Springer
14 years 5 days ago
2004
Springer
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
MOBIHOC
2009
ACM
14 years 7 months ago
2009
ACM
Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor node...
CIKM
2006
Springer
13 years 10 months ago
2006
Springer
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...
ICPADS
2005
IEEE
14 years 11 days ago
2005
IEEE
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
SSD
2007
Springer
14 years 26 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 ...