Sciweavers

95 search results - page 12 / 19
» Random block-angular matrices for distributed data storage
Sort
View
SPAA
2003
ACM
14 years 22 days ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
HPCA
2011
IEEE
12 years 11 months ago
Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing
Flash memory based solid state drives (SSDs) have shown a great potential to change storage infrastructure fundamentally through their high performance and low power. Most recent ...
Feng Chen, Rubao Lee, Xiaodong Zhang
ML
2006
ACM
121views Machine Learning» more  ML 2006»
13 years 7 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
PERCOM
2011
ACM
12 years 11 months ago
Privacy preservation schemes for querying wireless sensor networks
—In this work we study the problem of query privacy in large scale sensor networks. Motivated by a novel trust model in which clients query networks owned by trusted entities but...
Tassos Dimitriou, Ahmad Sabouri
ICSNW
2004
Springer
188views Database» more  ICSNW 2004»
14 years 26 days ago
Peer Selection in Peer-to-Peer Networks with Semantic Topologies
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
Peter Haase, Ronny Siebes, Frank van Harmelen