3422 search results - page 13 / 685 » Random Subset Optimization |
PKDD
2007
Springer
15 years 5 months ago
2007
Springer
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...
111
click to vote
RTSS
2003
IEEE
15 years 5 months ago
2003
IEEE
Scheduling disk requests with service guarantees has to bring the demand to meet guarantees in line with the need to optimize disk utilization. This paper presents the design, imp...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
In this work, the focus is put on the behavior of a system in case a fault occurs that disables the system from executing its applications. Instead of executing a random subset of...
101
click to vote
SPAA
2010
ACM
14 years 12 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...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...