3096 search results - page 206 / 620 » The Generalized FITC Approximation |
150
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
155
Voted
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper, we present the structure and design method for a firstorder linear-phase filter bank (FOLPFB) which has unequal filter lengths in its synthesis bank (UFLPFB). A FOL...
120
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
121
click to vote
ERCIMDL
2007
Springer
15 years 11 months ago
2007
Springer
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
137
Voted
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...