Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
983
Approximation Algorithms for Maximum Latency and Partial Cycle Cover
, 2008
"... We present approximation algorithms for four variations of the maximum latency problem. We consider symmetric graphs and asymmetric graphs and both with general edge weights or weights satisfying the triangle inequality. Moreover, in each variation the starting point of the tour may either be given ..."
Abstract
- Add to MetaCart
We present approximation algorithms for four variations of the maximum latency problem. We consider symmetric graphs and asymmetric graphs and both with general edge weights or weights satisfying the triangle inequality. Moreover, in each variation the starting point of the tour may either be given
Computing Alternate Multicast Trees with Maximum Latency Guarantee
"... Abstract—The growing demand for online media content delivery and multi-player gaming is expected to increase the amount of multicast service requests in both public and private networks. Careful traffic engineering of multicast service requests is becoming increasingly essential, as establishing th ..."
Abstract
- Add to MetaCart
approach is the timely construction of the set of alternate trees for every given root and destination set. An algorithm is proposed to compute multiple sub-optimal tree candidates with a guaranteed upper bound on the maximum end-to-end transmission latency. The algorithm builds on the widely used K
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
- In Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO
, 2004
"... We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a desira ..."
Abstract
-
Cited by 24 (0 self)
- Add to MetaCart
We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a
Online detection of vocal listener responses with maximum latency constraints
- In Proceedings ICASSP 2011
, 2011
"... When human listeners utter Listener Responses (e.g. back-channels or acknowledgments) such as ‘yeah ’ and ‘mmhmm’, interlocutors commonly continue to speak or resume their speech even before the listener has finished his/her response. This type of speech interactivity results in frequent speech over ..."
Abstract
-
Cited by 7 (3 self)
- Add to MetaCart
as Listener Responses. We show that it is possible to detect vocal Listener Responses using maximum latency thresholds of 100-500 ms, thereby obtaining equal error rates ranging from 34% to 28 % by using an energy based voice activity detector. Index Terms — Speech processing, speech analysis 1.
Stronger Bounds on Braess’s Paradox and the Maximum Latency of Selfish Routing
, 2009
"... We give several new upper and lower bounds on the worst-case severity of Braess’s Paradox and the price of anarchy of selfish routing with respect to the maximum latency objective. In single-commodity networks with unrestricted latency functions, we prove that this worst-case price of anarchy is exa ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
We give several new upper and lower bounds on the worst-case severity of Braess’s Paradox and the price of anarchy of selfish routing with respect to the maximum latency objective. In single-commodity networks with unrestricted latency functions, we prove that this worst-case price of anarchy
Scalable Application Layer Multicast
, 2002
"... We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data deliv ..."
Abstract
-
Cited by 731 (21 self)
- Add to MetaCart
sites. In our experiments, averagegroup members established and maintained low-latency paths and incurred a maximum packet loss rate of less than 1 % as members randomly joined and left the multicast group. The average control overhead during our experiments was less than 1 Kbps for groups of size 100.
Removal Policies in Network Caches for World-Wide Web Documents
, 1996
"... World-Wide Web proxy servers that cache documents can potentially reduce three quantities: the number of requests that reach popular servers, the volume of network traffic resulting from document requests, and the latency that an end-user experiences in retrieving a document. This paper examines the ..."
Abstract
-
Cited by 227 (4 self)
- Add to MetaCart
World-Wide Web proxy servers that cache documents can potentially reduce three quantities: the number of requests that reach popular servers, the volume of network traffic resulting from document requests, and the latency that an end-user experiences in retrieving a document. This paper examines
Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations,”
- The International Journal of Robotics Research,
, 2014
"... Abstract In this paper, we consider the problem of planning a path for a robot to monitor a known set of features of interest in an environment. We represent the environment as a graph with vertex weights and edge lengths. The vertices represent regions of interest, edge lengths give travel times b ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
between regions, and the vertex weights give the importance of each region. As the robot repeatedly performs a closed walk on the graph, we define the weighted latency of a vertex to be the maximum time between visits to that vertex, weighted by the importance (vertex weight) of that vertex. Our goal
The Price of Selfish Routing
, 2007
"... We study the problem of routing traffic through a congested network. We focus on the simplest case of a network consisting of m parallel links. We assume a collection of n network users; each user employs a mixed strategy, which is a probability distribution over links, to control the shipping of ..."
Abstract
-
Cited by 132 (26 self)
- Add to MetaCart
of its own assigned traffic. Given a capacity for each link specifying the rate at which the link processes traffic, the objective is to route traffic so that the maximum (over all links) latency is minimized. We consider both uniform and arbitrary link capacities. How much decrease in global performance
Estimating stimulus response latency
, 1998
"... Stimulus response latency is the delay in the onset of stimulus-evoked neuronal activity. We develop maximum likelihood and least squares estimators of stimulus response latency and present a comparison of the performance of these methods with estimators commonly used in the neuroscience literature. ..."
Abstract
- Add to MetaCart
Stimulus response latency is the delay in the onset of stimulus-evoked neuronal activity. We develop maximum likelihood and least squares estimators of stimulus response latency and present a comparison of the performance of these methods with estimators commonly used in the neuroscience literature
Results 1 - 10
of
983
