Sciweavers

5063 search results - page 393 / 1013
» Personalized Data Set for Analysis
Sort
View
WWW
2007
ACM
16 years 7 months ago
A clustering method for web data with multi-type interrelated components
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
SEMWEB
2010
Springer
15 years 4 months ago
Summary Models for Routing Keywords to Linked Data Sources
The proliferation of linked data on the Web paves the way to a new generation of applications that exploit heterogeneous data from different sources. However, because this Web of d...
Thanh Tran, Lei Zhang, Rudi Studer
MOBIHOC
2001
ACM
16 years 6 months ago
Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices
This paper presents 7DS, a novel peer-to-peer data sharing system. 7DS is an architecture, a set of protocols and an implementation enabling the exchange of data among peers that ...
Maria Papadopouli, Henning Schulzrinne
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 11 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
HIPEAC
2009
Springer
15 years 10 months ago
Deriving Efficient Data Movement from Decoupled Access/Execute Specifications
Abstract. On multi-core architectures with software-managed memories, effectively orchestrating data movement is essential to performance, but is tedious and error-prone. In this p...
Lee W. Howes, Anton Lokhmotov, Alastair F. Donalds...