Sciweavers

288 search results - page 15 / 58
» On Similarity-Invariant Fairness Measures
Sort
View
FITRAMEN
2008
13 years 9 months ago
A Fair and Dynamic Load-Balancing Mechanism
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
Federico Larroca, Jean-Louis Rougier
WSCG
2004
155views more  WSCG 2004»
13 years 9 months ago
NURBS Fairing by Knot Vector Optimization
The shape of a NURBS curve or patch is defined by the location of its control points, the weights associated with these points, and the parameter intervals, also called the knot v...
Barnabás Aszódi, Szabolcs Czuczor, L...
PRL
2007
163views more  PRL 2007»
13 years 7 months ago
A model based approach for pose estimation and rotation invariant object matching
Pose estimation has been considered to be an important component in many pattern recognition and computer vision systems. In this paper, we introduce a pose estimation method base...
Cem Ünsalan
ANCS
2005
ACM
14 years 1 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
CLUSTER
2000
IEEE
13 years 7 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...