303 search results - page 54 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
TCS
2008
13 years 7 months ago
2008
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
INFORMATICALT
2002
13 years 7 months ago
2002
The problem of recursive estimation of a state of dynamic systems in the presence of time-varying outliers in observations to be processed has been considered. A learning phase use...
TMC
2010
13 years 5 months ago
2010
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...
ANOR
2010
13 years 5 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—We analyze a comprehensive model for multi-class job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or time-average sum of lin...