Sciweavers

14 search results - page 2 / 3
» Randomized Sorting on the POPS Network
Sort
View
ISAAC
1994
Springer
80views Algorithms» more  ISAAC 1994»
13 years 9 months ago
Unifying Themes for Network Selection
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
MOBIQUITOUS
2007
IEEE
13 years 11 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
IPPS
1997
IEEE
13 years 8 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
BMCBI
2007
202views more  BMCBI 2007»
13 years 4 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
ICDCS
2007
IEEE
13 years 11 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...