Sciweavers

2836 search results - page 360 / 568
» Parsing Algorithms and Metrics
Sort
View
CCGRID
2004
IEEE
15 years 11 months ago
Supporting quality of service in a non-dedicated opportunistic environment
In this paper we investigate the utilization of nondedicated, opportunistic resources in a desktop environment to provide statistical assurances to a class of QoS sensitive, soft ...
Jin Liang, Klara Nahrstedt
TON
2002
91views more  TON 2002»
15 years 7 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
INFOCOM
2000
IEEE
15 years 11 months ago
Minimum Interference Routing with Applications to MPLS Traffic Engineering
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
Murali S. Kodialam, T. V. Lakshman
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
15 years 2 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
CVPR
2001
IEEE
16 years 9 months ago
A Nonparametric Statistical Comparison of Principal Component and Linear Discriminant Subspaces for Face Recognition
The FERET evaluation compared recognition rates for different semi-automated and automated face recognition algorithms. We extend FERET by considering when differences in recognit...
J. Ross Beveridge, Kai She, Bruce A. Draper, Geof ...