15485 search results - page 192 / 3097 » Computing Optimal Subsets |
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 ...
190
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...
165
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 ...
167
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Expression microarrays are increasingly used to characterize environmental responses and hostparasite interactions for many different organisms. Probe selection for cD...
183
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...