Sciweavers

1404 search results - page 138 / 281
» On General Laws of Complex Networks
Sort
View
IPPS
2006
IEEE
15 years 10 months ago
Tree-based overlay networks for scalable applications
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
Dorian C. Arnold, G. D. Pack, Barton P. Miller
WPES
2006
ACM
15 years 10 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
CODES
2005
IEEE
15 years 10 months ago
FlexPath NP: a network processor concept with application-driven flexible processing paths
In this paper, we present a new architectural concept for network processors called FlexPath NP. The central idea behind FlexPath NP is to systematically map network processor (NP...
Rainer Ohlendorf, Andreas Herkersdorf, Thomas Wild
FOCS
1999
IEEE
15 years 8 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
IPPS
1998
IEEE
15 years 8 months ago
Network-Aware Distributed Computing: A Case Study
Abstract. The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applicatio...
Hongsuda Tangmunarunkit, Peter Steenkiste