Sciweavers

455 search results - page 11 / 91
» Distributed Processes on Tree Hash
Sort
View
SC
1991
ACM
13 years 11 months ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 9 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
ERLANG
2003
ACM
14 years 24 days ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
ICASSP
2009
IEEE
14 years 2 months ago
Rate-constrained distributed distance testing and its applications
We investigate a practical approach to solving one instantiation of a distributed hypothesis testing problem under severe rate constraints that shows up in a wide variety of appli...
Chuohao Yeo, Parvez Ahammad, Hao Zhang, Kannan Ram...
ICDCS
2009
IEEE
14 years 4 months ago
m-LIGHT: Indexing Multi-Dimensional Data over DHTs
In this paper, we study the problem of indexing multidimensional data in the P2P networks based on distributed hash tables (DHTs). We identify several design issues and propose a ...
Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-Chie...