Sciweavers

814 search results - page 151 / 163
» Optimal pairings
Sort
View
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 10 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
SIGMOD
2006
ACM
158views Database» more  SIGMOD 2006»
14 years 10 months ago
Continuous query processing in data streams using duality of data and queries
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
Hyo-Sang Lim, Jae-Gil Lee, Min-Jae Lee, Kyu-Young ...
IPPS
2009
IEEE
14 years 4 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
CIKM
2009
Springer
14 years 4 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
IFIP
2009
Springer
14 years 4 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi