OPODIS
2010
13 years 7 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
OPODIS
2010
13 years 7 months ago
2010
Paxos is a well known algorithm for achieving consensus in distributed environments with uncertain processing and communication timing. Implementations of its variants have been s...
OPODIS
2010
13 years 7 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
NAACL
2010
13 years 7 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
MICCAI
2010
Springer
13 years 7 months ago
2010
Springer
Groupwise registration has been widely investigated in recent years due to its importance in analyzing population data in many clinical applications. To our best knowledge, most o...
MICCAI
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...
MICCAI
2010
Springer
13 years 7 months ago
2010
Springer
The 3-D reconstruction of cardiac vasculature using C-arm CT is an active and challenging field of research. In interventional environments patients often do have arrhythmic heart ...
MASCOTS
2010
13 years 7 months ago
2010
Requests scheduling in Web servers is a hot research topic. Many works aim at providing optimal algorithms according to various metrics. Most of these works are based on classical ...
IWPEC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
ISPDC
2010
IEEE
13 years 7 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...