Sciweavers

184 search results - page 28 / 37
» Efficient Range Query Retrieval for Non-Uniform Data Distrib...
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 3 months ago
Continuous Medoid Queries over Moving Objects
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 ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
HOTOS
2007
IEEE
15 years 1 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
SIGMOD
2003
ACM
125views Database» more  SIGMOD 2003»
15 years 9 months ago
An Optimal and Progressive Algorithm for Skyline Queries
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Se...
DELOS
2007
14 years 11 months ago
Integration of Reliable Sensor Data Stream Management into Digital Libraries
Data Stream Management (DSM) addresses the continuous processing of sensor data. DSM requires the combination of stream operators, which may run on different distributed devices, ...
Gert Brettlecker, Heiko Schuldt, Peter M. Fischer,...
JOCN
2010
70views more  JOCN 2010»
14 years 8 months ago
Optimizing Design Efficiency of Free Recall Events for fMRI
■ Free recall is a fundamental paradigm for studying memory retrieval in the context of minimal cue support. Accordingly, free recall has been extensively studied using behavior...
Ilke Öztekin, Nicole M. Long, David Badre