15485 search results - page 237 / 3097 » Computing Optimal Subsets |
170
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
167
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The large number of spectral variables in most data sets encountered in spectral chemometrics often renders the prediction of a dependent variable uneasy. The number of variables ...
214
click to vote
SIAMJO
2010
15 years 4 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
163
click to vote
ICMCS
2008
IEEE
16 years 28 days ago
2008
IEEE
We consider how to exploit the correlation in image for compression by virtue of studying image patches in a nonparametric manner. Instead of extracting and recording parameters, ...
197
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...