Sciweavers

15 search results - page 2 / 3
» Improved Approximation Guarantees for Weighted Matching in t...
Sort
View
CCR
2006
122views more  CCR 2006»
13 years 5 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
13 years 9 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 8 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 6 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
CVPR
2003
IEEE
14 years 7 months ago
A Novel Model for Orientation Field of Fingerprints
As a global feature of fingerprint, orientation field is very important to automatic fingerprint identification system (AFIS). Establishing an accurate and concise model for orien...
Jinwei Gu, Jie Zhou