1511 search results - page 75 / 303 » Randomness, lowness and degrees |
SIAMREV
2010
14 years 6 months ago
2010
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
124
click to vote
FGR
2004
IEEE
15 years 3 months ago
2004
IEEE
LDA is a popular subspace based face recognition approach. However, it often suffers from the small sample size problem. When dealing with the high dimensional face data, the LDA ...
NIPS
2001
15 years 1 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
116
click to vote
DAGM
2008
Springer
15 years 1 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...