Sciweavers

455 search results - page 6 / 91
» Distributed Processes on Tree Hash
Sort
View
EUROPAR
2011
Springer
12 years 7 months ago
A Generic Parallel Collection Framework
Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hashtables and trees. These data ...
Aleksandar Prokopec, Phil Bagwell, Tiark Rompf, Ma...
ICIP
2008
IEEE
14 years 2 months ago
Rate-efficient visual correspondences using random projections
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...
Chuohao Yeo, Parvez Ahammad, Kannan Ramchandran
NCA
2006
IEEE
14 years 1 months ago
Congestion Control for Distributed Hash Tables
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer
DSOM
2006
Springer
13 years 11 months ago
Towards Distributed Hash Tables (De)Composition in Ambient Networks
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
Lawrence Cheng, Roel Ocampo, Kerry Jean, Alex Gali...
GCB
2007
Springer
91views Biometrics» more  GCB 2007»
14 years 1 months ago
A Study on the Empirical Support for Prior Distributions on Phylogenetic Tree Topologies
: There are several models for the evolutionary process forming a species tree. We examine the Birth-and-Death model (BDM), the Proportional-to-Distinguishable Arrangements (PDA) m...
Lin Himmelmann, Dirk Metzler