139 search results - page 6 / 28 » Fast perfect sampling from linear extensions |
CIARP
2004
Springer
15 years 1 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
78
Voted
CVPR
2007
IEEE
15 years 4 months ago
2007
IEEE
Aiming at the problem when both positive and negative training set are enormous, this paper proposes a novel Matrix-Structural Learning (MSL) method, as an extension to Viola and ...
87
Voted
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
MP
2008
14 years 9 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
87
Voted
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...