Sciweavers

4411 search results - page 262 / 883
» Communication Complexity and Its Applications
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
SPAA
2004
ACM
16 years 1 days ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
ICT
2004
Springer
139views Communications» more  ICT 2004»
16 years 48 min ago
A XML Policy-Based Approach for RSVP
This work proposes a XML-based framework for distributing and enforcing RSVP access control policies, for RSVP-aware application servers. Policies are represented by extending XAC...
Emir Toktar, Edgard Jamhour, Carlos Maziero
ACISP
2001
Springer
15 years 11 months ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito
GPC
2008
Springer
15 years 7 months ago
Write Once, Run Anywhere - A Survey of Mobile Runtime Environments
The hype surrounding Web 2.0 and technologies such as AJAX shows: The future of distributed application development lies in Rich Internet Applications (RIAs), which are based on h...
Sören Blom, Matthias Book, Volker Gruhn, Rusl...