Sciweavers

34 search results - page 6 / 7
» Parking functions, valet functions and priority queues
Sort
View
CVIU
2008
180views more  CVIU 2008»
13 years 6 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
EOR
2010
110views more  EOR 2010»
13 years 6 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
MST
2011
200views Hardware» more  MST 2011»
13 years 28 days ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...
IWDC
2001
Springer
101views Communications» more  IWDC 2001»
13 years 10 months ago
Resource Stealing in Endpoint Controlled Multi-class Networks
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...
Susana Sargento, Rui Valadas, Edward W. Knightly
ICWE
2010
Springer
13 years 10 months ago
AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads
:  AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Persone, Ningfang Mi, Evgenia Smirn...
Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Pers...