Search
Now showing items 851-860 of 976
Restoration of partially occluded shapes of faces using neural networks
(2005)
One of the major difficulties encountered in the development of face image processing algorithms, is the possible presence of occlusions that hide part of the face images to be processed.Typical examples of facial occlusions ...
Anomalous chiral current commutators and divergence
(1988)
The anomalous chiral current commutators and divergence are calculated in the canonical formalism, within a proposed general framework suitable for the study of anomalies. This framework incorporates a generalized form of ...
Users key locations in online social networks: identification and applications
(2016)
Ubiquitous Internet connectivity enables users to update their Online Social Network profile from any location and at any point in time. These, often geo-tagged, data can be used to provide valuable information to closely ...
Linearizability in the presence of drifting clocks and under different delay assumptions
(1999)
The cost of usingmessag e-passing to implement linearizable read/write objects for shared memory multiprocessors with drifting clocks is studied. We take as cost measures the response times for performingread and write ...
Meeting the deadline: On the complexity of fault-tolerant continuous gossip
(2011)
In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
Evaluating a dependable sharable atomic data service on a planetary-scale network
(2009)
Practical implementations of atomically consistent read/write memory service are important building blocks for higher level applications. This is especially true when data accessibility and survivability are provided by a ...
On the automated implementation of time-based Paxos using the IOA compiler
(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 successfully used in the industry (eg., ...
On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts
(2015)
To identify the tradeoffs between efficiency and fault-tolerance in dynamic cooperative computing, we initiate the study of a task performing problem under dynamic processes' crashes/restarts and task injections. The system ...