Sciweavers

1578 search results - page 101 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
CLADE
2004
IEEE
14 years 17 days ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
WWW
2003
ACM
14 years 9 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
RECOMB
2007
Springer
14 years 9 months ago
Reconstructing the Topology of Protein Complexes
Abstract. Recent advances in high-throughput experimental techniques have enabled the production of a wealth of protein interaction data, rich in both quantity and variety. While t...
Allister Bernard, David S. Vaughn, Alexander J. Ha...
TPDS
2010
126views more  TPDS 2010»
13 years 3 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
COMPGEOM
2009
ACM
14 years 3 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan