Sciweavers

221 search results - page 5 / 45
» Random Indexing K-tree
Sort
View
TIT
2008
95views more  TIT 2008»
13 years 7 months ago
Distributed Estimation Via Random Access
The problem of distributed Bayesian estimation is considered in the context of a wireless sensor network. The Bayesian estimation performance is analyzed in terms of the expected F...
Animashree Anandkumar, Lang Tong, Ananthram Swami
CIDR
2011
252views Algorithms» more  CIDR 2011»
12 years 11 months ago
Hyder - A Transactional Record Manager for Shared Flash
Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool ...
Philip A. Bernstein, Colin W. Reid, Sudipto Das
ICDE
2009
IEEE
152views Database» more  ICDE 2009»
14 years 9 months ago
Tree Indexing on Flash Disks
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...
Yinan Li, Bingsheng He, Qiong Luo, Ke Yi
PVLDB
2010
150views more  PVLDB 2010»
13 years 5 months ago
Tree Indexing on Solid State Drives
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption a...
Yinan Li, Bingsheng He, Jun Yang 0001, Qiong Luo, ...
DSN
2011
IEEE
12 years 7 months ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...