1722 search results - page 132 / 345 » On the sample mean of graphs |
173
click to vote
FTNET
2006
15 years 6 months ago
2006
This article reviews progress in cooperative communication networks. Our survey is by no means exhaustive. Instead, we assemble a representative sample of recent results to serve ...
169
click to vote
IJISTA
2007
15 years 6 months ago
2007
: This paper introduces a system for real-time incremental learning in a call-centre environment. The classifier used is a Support Vector Machine (SVM) and it is applied to telepho...
152
click to vote
NECO
2000
15 years 6 months ago
2000
The class of finite mixtures of multivariate Bernoulli distributions is known to be nonidentifiable, i.e., different values of the mixture parameters can correspond to exactly the...
187
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
130
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...