3422 search results - page 224 / 685 » Random Subset Optimization |
197
click to vote
JMLR
2012
13 years 8 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
208
click to vote
SSPR
2004
Springer
15 years 11 months ago
2004
Springer
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
184
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
192
Voted
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
166
click to vote
JOIN
2007
15 years 6 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...