Sciweavers

393 search results - page 69 / 79
» The LCA Problem Revisited
Sort
View
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 8 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
FIW
2000
114views Communications» more  FIW 2000»
13 years 8 months ago
Feature Interaction in Internet Telephony
While Internet telephony aims to provide services at least equal to traditional telephony, the architecture of Internet telephony is sufficiently different to make it necessary to ...
Jonathan Lennox, Henning Schulzrinne
CONCUR
2010
Springer
13 years 7 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
Sequential Rationality in Cryptographic Protocols
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
Ronen Gradwohl, Noam Livne, Alon Rosen
EOR
2010
125views more  EOR 2010»
13 years 7 months ago
Efficient estimation of large portfolio loss probabilities in t-copula models
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
Joshua C. C. Chan, Dirk P. Kroese