2925 search results - page 254 / 585 » Information Complexity of Online Problems |
178
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
174
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
Spread Transform (ST) is a quantization watermarking algorithm in which vectors of the wavelet coefficients of a host work are quantized, using one of two dithered quantizers, to ...
162
click to vote
ISCIS
2004
Springer
16 years 8 hour ago
2004
Springer
Abstract. We present a performance modelling case study of a distributed multi-player game expressed in the PEPA nets modelling language. The case study provides a modern complex d...
172
click to vote
JC
2007
15 years 6 months ago
2007
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
191
click to vote
HIPC
2005
Springer
16 years 5 days ago
2005
Springer
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...