Sciweavers

85 search results - page 13 / 17
» Open Bisimulation, Revisited
Sort
View
PODC
2003
ACM
15 years 3 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
CLUSTER
2001
IEEE
15 years 1 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert
PVLDB
2008
118views more  PVLDB 2008»
14 years 9 months ago
Column-store support for RDF data management: not all swans are white
This paper reports on the results of an independent evaluation of the techniques presented in the VLDB 2007 paper "Scalable Semantic Web Data Management Using Vertical Partit...
Lefteris Sidirourgos, Romulo Goncalves, Martin L. ...
EIS
2011
253views ECommerce» more  EIS 2011»
14 years 5 months ago
A modelling and reasoning framework for social networks policies
Policy languages (such as privacy and rights) have had little impact on the wider community. Now that Social Networks have taken off, the need to revisit Policy languages and real...
Guido Governatori, Renato Iannella
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
13 years 10 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin