1451 search results - page 14 / 291 » Order independence and rationalizability |
ISIPTA
1999
IEEE
14 years 22 days ago
1999
IEEE
In this paper we try to clarify the notion of independence for imprecise probabilities. Our main point is that there are several possible definitions of independence which are app...
APPML
2010
13 years 8 months ago
2010
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
JUCS
2007
13 years 8 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...