4377 search results - page 384 / 876 » Mass problems and randomness |
198
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
159
click to vote
EOR
2010
15 years 7 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
188
click to vote
JAIR
2007
15 years 6 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
206
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
195
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
The notion of using context information for solving highlevel vision problems has been increasingly realized in the field. However, how to learn an effective and efficient context...