Sciweavers

4926 search results - page 421 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICDCS
2009
IEEE
15 years 11 months ago
On Optimal Concurrency Control for Optimistic Replication
Concurrency control is a core component in optimistic replication systems. To detect concurrent updates, the system associates each replicated object with metadata, such as, versi...
Weihan Wang, Cristiana Amza
NSPW
1998
ACM
15 years 8 months ago
Meta Objects for Access Control: a Formal Model for Role-Based Principals
Object-based programming is becoming more and more popular and is currently conquering the world of distributed programming models. In object-based systems access control is often...
Thomas Riechmann, Franz J. Hauck
SPDP
1991
IEEE
15 years 7 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
GD
2003
Springer
15 years 9 months ago
Radial Level Planarity Testing and Embedding in Linear Time
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 9 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella