Results 1  10
of
1,623
Network coding for nonuniform demands
 in Proceedings of International Symposium on Information Theory
, 2005
"... AbstractNonuniform demand networks are defined as a useful connection model, in between multicasts and general connections. In these networks, each sink demands a certain number of messages, without specifying their identities. We study the solvability of such networks and give a tight bound on t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
AbstractNonuniform demand networks are defined as a useful connection model, in between multicasts and general connections. In these networks, each sink demands a certain number of messages, without specifying their identities. We study the solvability of such networks and give a tight bound
Secure Caching with NonUniform Demands
"... AbstractCaching helps in reducing network load at times of heavy traffic by utilizing content duplication, local file storage and multicast content delivery. The multicast delivery could be prone to information leakage if a user becomes malicious or if the multicast link is tapped by an external a ..."
Abstract
 Add to MetaCart
adversary. In this paper, we introduce the concept of informationtheoretically secure file delivery when the files have a nonuniform popularity distribution. For this scenario, the cache memory of each user is split into two parts: one part is used to store data (some function of the files), whereas
LowComplexity NonUniform Demand Multicast Network Coding Problems
"... The nonuniform demand network coding problem is posed as a singlesource and multiplesink network transmission problem where the sinks may have heterogeneous demands. In contrast with multicast problems, nonuniform demand problems are concerned with the amounts of data received by each sink, ra ..."
Abstract
 Add to MetaCart
The nonuniform demand network coding problem is posed as a singlesource and multiplesink network transmission problem where the sinks may have heterogeneous demands. In contrast with multicast problems, nonuniform demand problems are concerned with the amounts of data received by each sink
GLOBAL COMPETITION FOR THE JAPANESE FRUIT JUICE MARKET: A Uniform Demand Analysis
"... Readers may make verbatim copies of this document for noncommercial purposes by any means, provided that this copyrights notice appears on all such copies. 2 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Readers may make verbatim copies of this document for noncommercial purposes by any means, provided that this copyrights notice appears on all such copies. 2
Multicommodity maxflow mincut theorems and their use in designing approximation algorithms
 J. ACM
, 1999
"... In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound implied by ..."
Abstract

Cited by 357 (6 self)
 Add to MetaCart
In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound implied
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
, 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
9 task provided that the capacity of each cut exceeds the demand across the cut by a b(log n) factor. The condition on cuts is required in the worst case, and is trivially within a i(log n) factor of optimal for any flow problem. The result is of interest because it can be used to construct
Demand Reduction and Inefficiency in Multiunit Auctions
, 2013
"... Auctions typically involve the sale of many related goods. Treasury, spectrum and electricity auctions are examples. In auctions where bidders pay the marketclearing price for items won, large bidders have an incentive to reduce demand in order to pay less for their winnings. This incentive creates ..."
Abstract

Cited by 197 (19 self)
 Add to MetaCart
creates an inefficiency in multipleitem auctions. Large bidders reduce demand for additional items and so sometimes lose to smaller bidders with lower values. We demonstrate this inefficiency in an auction model which allows interdependent values. We also establish that the ranking of the uniform
ARC: A SelfTuning, Low Overhead Replacement Cache
 In Proceedings of the 2003 Conference on File and Storage Technologies (FAST
, 2003
"... We consider the problem of cache management in a demand paging scenario with uniform page sizes. We propose a new cache management policy, namely, Adaptive Replacement Cache (ARC), that has several advantages. ..."
Abstract

Cited by 225 (5 self)
 Add to MetaCart
We consider the problem of cache management in a demand paging scenario with uniform page sizes. We propose a new cache management policy, namely, Adaptive Replacement Cache (ARC), that has several advantages.
An Empirical Model of Firm Entry with Endogenous ProductType Choices,” working paper, Graduate
, 2002
"... This paper presents a model of entry with endogenous producttype choices. These choices are formalized as the outcomes of a game of incomplete information in which rivals ’ differentiated products have nonuniform competitive effects on firms ’ profits. The model is estimated for location choices i ..."
Abstract

Cited by 195 (10 self)
 Add to MetaCart
This paper presents a model of entry with endogenous producttype choices. These choices are formalized as the outcomes of a game of incomplete information in which rivals ’ differentiated products have nonuniform competitive effects on firms ’ profits. The model is estimated for location choices
Behavior in multiunit demand auctions: experiments with uniformprice and dynamic Vickrey auctions
 Econometrica
, 2001
"... We experimentally investigate the sensitivity of bidders demanding multiple units of a homogeneous commodity to the demand reduction incentives inherent in uniform price auctions. There is substantial demand reduction in both sealed bid and ascending price clock auctions with feedback regarding riva ..."
Abstract

Cited by 81 (8 self)
 Add to MetaCart
We experimentally investigate the sensitivity of bidders demanding multiple units of a homogeneous commodity to the demand reduction incentives inherent in uniform price auctions. There is substantial demand reduction in both sealed bid and ascending price clock auctions with feedback regarding
Results 1  10
of
1,623