Sciweavers

251 search results - page 7 / 51
» AMVA techniques for high service time variability
Sort
View
107
Voted
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 4 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
70
Voted
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 5 months ago
Polynomial Estimators for High Frequency Moments
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
Sumit Ganguly
72
Voted
CVPR
2007
IEEE
16 years 8 days ago
Tracking Large Variable Numbers of Objects in Clutter
We propose statistical data association techniques for visual tracking of enormously large numbers of objects. We do not assume any prior knowledge about the numbers involved, and...
Margrit Betke, Diane E. Hirsh, Angshuman Bagchi, N...
IPPS
2009
IEEE
15 years 4 months ago
Flexible pipelining design for recursive variable expansion
Many image and signal processing kernels can be optimized for performance consuming a reasonable area by doing loops parallelization with extensive use of pipelining. This paper p...
Zubair Nawaz, Thomas Marconi, Koen Bertels, Todor ...
77
Voted
PE
2006
Springer
111views Optimization» more  PE 2006»
14 years 10 months ago
How many servers are best in a dual-priority M/PH/k system?
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
Adam Wierman, Takayuki Osogami, Mor Harchol-Balter...