Sciweavers

4536 search results - page 136 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Tree-structure lossless coding using intervector angle
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
Jun Rokui
CONPAR
1992
14 years 1 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
PR
2006
107views more  PR 2006»
13 years 9 months ago
Pyramid segmentation algorithms revisited
The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, ...
Rebeca Marfil, Luis Molina-Tanco, Antonio Bandera,...
CIKM
2011
Springer
12 years 9 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
ICPP
2008
IEEE
14 years 3 months ago
Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters
In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems. These systems often have hierarchically s...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...