2354 search results - page 249 / 471 » Assignment Problems |
178
click to vote
IWSOS
2007
Springer
16 years 20 days ago
2007
Springer
A routing protocol is designed considering a particular environment all the time which is not possible in the case of practical ad hoc networks. Because of the uncertainty in topol...
167
click to vote
SPEECH
1998
15 years 6 months ago
1998
We present the theory for heteroscedastic discriminant analysis (HDA), a model-based generalization of linear discriminant analysis (LDA) derived in the maximum-likelihood framewo...
159
click to vote
NOCS
2007
IEEE
16 years 24 days ago
2007
IEEE
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
163
click to vote
STACS
2007
Springer
16 years 19 days ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
167
click to vote
HYBRID
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. An important class of soft real-time applications require dynamic allocation of computational resources in order to comply with their quality of service (QoS) requirement...