5372 search results - page 895 / 1075 » complexity 2007 |
140
click to vote
PE
2007
Springer
15 years 4 months ago
2007
Springer
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...
132
click to vote
PR
2007
15 years 4 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
136
click to vote
PR
2007
15 years 4 months ago
2007
In this paper, we propose a new constructive method, based on cooperative coevolution, for designing automatically the structure of a neural network for classification. Our appro...
139
click to vote
PRL
2007
15 years 4 months ago
2007
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
158
click to vote
QUESTA
2007
15 years 4 months ago
2007
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...