Sciweavers

473 search results - page 17 / 95
» The Case for Quantum Key Distribution
Sort
View
JPDC
2002
104views more  JPDC 2002»
13 years 7 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
AINA
2007
IEEE
14 years 1 months ago
Heuristics for Improving Cryptographic Key Assignment in a Hierarchy
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl
ICIS
2001
13 years 8 months ago
Knowledge Integration as a Key Problem in an ERP Implementation
Whilepreviousstudieshavefocusedmainlyonthepotentialbenefitsandcriticalsuccessfactorsassociatedwith ERPimplementation,veryfewhaveexploredtheimportantissues of impediments encounter...
Shan Ling Pan, Sue Newell, Jimmy C. Huang, Alvin W...
CAIP
2005
Springer
133views Image Analysis» more  CAIP 2005»
14 years 1 months ago
Finding the Number of Clusters for Nonparametric Segmentation
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
Nikolaos Nasios, Adrian G. Bors
REPLICATION
2010
13 years 5 months ago
Replicating for Performance: Case Studies
In this chapter we take a look at the application of replication techniques for building scalable distributed systems. Unlike using replication for attaining dependability, replica...
Maarten van Steen, Guillaume Pierre