Results 1  10
of
1,808
Mincost Selfish Multicast with Network Coding
, 2006
"... The singlesource mincost multicast problem, which can be framed as a convex optimization problem with the use of network codes and convex increasing edge costs is considered. A decentralized approach to this problem is presented by Lun, Ratnakar et. al. for the case where all users cooperate to r ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
The singlesource mincost multicast problem, which can be framed as a convex optimization problem with the use of network codes and convex increasing edge costs is considered. A decentralized approach to this problem is presented by Lun, Ratnakar et. al. for the case where all users cooperate
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
paging, a setting in which the access cost is not convex. The paging rule corresponding to movetofront is the “least recently used” (LRU) replacement rule. We analyze the amortized complexity of LRU, showing that its efficiency differs from that of the offline paging rule (Belady’s MIN algorithm) by a
Structured prediction, dual extragradient and Bregman projections
 Journal of Machine Learning Research
, 2006
"... We present a simple and scalable algorithm for maximummargin estimation of structured output models, including an important class of Markov networks and combinatorial models. We formulate the estimation problem as a convexconcave saddlepoint problem that allows us to use simple projection methods ..."
Abstract

Cited by 59 (2 self)
 Add to MetaCart
methods based on the dual extragradient algorithm (Nesterov, 2003). The projection step can be solved using dynamic programming or combinatorial algorithms for mincost convex flow, depending on the structure of the problem. We show that this approach provides a memoryefficient alternative
Structured prediction via the extragradient method
"... We present a simple and scalable algorithm for largemargin estimation of structured models, including an important class of Markov networks and combinatorial models. The estimation problem can be formulated as a quadratic program (QP) that exploits the problem structure to achieve polynomial number ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
algorithms for mincost convex flow. We provide linear convergence guarantees for our method and present experiments on two very different structured prediction tasks: 3D image segmentation and word alignment, illustrating the favorable scaling properties of our algorithm.
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
. Thus, we examine how changes in credit spreads respond to proxies for both changes in the probability of future default and for changes in the recovery rate. Separately, recent empirical studies find that the corporate bond market tends to have relatively high transactions costs and low volume. 1
MinCost Multicast of Selfish Information Flows
 in Proceedings of IEEE INFOCOM
, 2007
"... Abstract—We study multicast in a noncooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost, th ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
Abstract—We study multicast in a noncooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost
Datalevel Parallel Solution of Mincost Network Flow Problems Using epsilonRelaxations
, 1994
"... this report is restricted to network flow problems. Several classes of nonlinear network optimization problems have benefited from the design and implementation of massively parallel algorithms. For a recent survey see Zenios [1991]. Interestingly, nonlinear problems are much easier to solve on mass ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this report is restricted to network flow problems. Several classes of nonlinear network optimization problems have benefited from the design and implementation of massively parallel algorithms. For a recent survey see Zenios [1991]. Interestingly, nonlinear problems are much easier to solve
Application of MinCost Flow to Airline Accessibility Services
, 2006
"... We formulate the problem as a network flow in which vertices are the locations of escorts and wheelchair passengers. Edges have costs that are functions of time and related to delays in servicing passengers. Escorts flow along the edges as they proceed through the day. The network is dynamically upd ..."
Abstract
 Add to MetaCart
updated as arrivals of wheelchair passengers are announced. We solve this mincost flow problem using network flow techniques such as price functions and the repeated use of Dijkstra’s algorithm. Our algorithm runs in an efficient polynomial time. We prove a theorem stating that to find a no
MinCost Multicast of Selfish Information Flows
"... Abstract—We study multicast in a noncooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost, th ..."
Abstract
 Add to MetaCart
Abstract—We study multicast in a noncooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost
Results 1  10
of
1,808