Color-line vector field and local color component decomposition for smoothing and denoising of color images

K Shirai, M Okuda, M Ikehara - Proceedings of the 21st …, 2012 - ieeexplore.ieee.org
Most conventional smoothing and denoising methods for color images deal with each color
channel independently, which results in discolorations due to unbalancing the relation …

A cluster oriented model for dynamically balanced DHTs

J Rufino, A Alves, J Exposto… - 18th International Parallel …, 2004 - ieeexplore.ieee.org
Summary form only given. We refine previous work on a model for a distributed hash table
(DHT) with support to dynamic balancement across a set of heterogeneous cluster nodes …

Domus–an architecture for cluster-oriented distributed hash tables

J Rufino, A Pina, A Alves, J Exposto - Parallel Processing and Applied …, 2006 - Springer
This paper presents a high level description of Domus, an architecture for cluster-oriented
Distributed Hash Tables. As a data management layer, Domus supports the concurrent …

pDomus: a prototype for Cluster-oriented Distributed Hash Tables

J Rufino, A Alves, J Exposto… - … Conference on Parallel …, 2007 - ieeexplore.ieee.org
The Domus architecture for Distributed Hash Tables (DHTs) is specially designed to support
the concurrent deployment of multiple and heterogeneous DHTs, in a dynamic shared-all …

Full-speed scalability of the pDomus platform for DHTs

J Rufino, A Pina, A Alves, J Exposto, RP Lopes - 2007 - bibliotecadigital.ipb.pt
Domus is an architecture for Distributed Hash Tables (DHTs) tailored to a shared-all cluster
environment. Domus DHTs build on a (dynamic) set of cluster nodes; each node may …

[PDF][PDF] A cluster oriented model for dynamically balanced DHTs

A Pina - Citeseer
In this paper, we refine previous work on a model for a Distributed Hash Table (DHT) with
support to dynamic balancement across a set of heterogeneous cluster nodes. We present …

Clustering

D Korzun, A Gurtov, D Korzun, A Gurtov - Structured Peer-to-Peer Systems …, 2013 - Springer
In the previous chapters we considered the dynamic differentiation of nodes and resources
in flat P2P systems. This chapter shows that the design principles of the differentiation …

Shortcut routing for chord graphs in the domus hash space

J Rufino, A Pina, A Alves, J Exposto - 2008 - bibliotecadigital.ipb.pt
We present and evaluate shortcut routing algorithms for Chord graphs in the hash space,
specifically developed to accelerate distributed lookups in the Distributed Hash Tables …

[PDF][PDF] Guia do Doutorando

JCR Amaro, AM da Silva Pina - 2006 - webarchive.di.uminho.pt
The interest on cluster computing has been growing, in part by the availability of powerful
microprocessors and high-speed networks as offthe-shelf commodity components, as well …

Co-operação de Tabelas de Hash Distribuídas em Clusters Heterogéneos

JCR Amaro - 2007 - search.proquest.com
Abstract As Estruturas de Dados Distribuídas (DDSs) constituem uma abordagem ao
Armazenamento Distribuído adequada a aplicações com requisitos de elevada capacidade …