4377 search results - page 486 / 876 » Mass problems and randomness |
185
Voted
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space - pixels, segments or group of segments. It...
213
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
190
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on t...
212
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length n such that the error probability goes to zero as n goes to infinity....
224
Voted
MA
2011
Springer
15 years 1 months ago
2011
Springer
The ratio of the largest eigenvalue divided by the trace of a p×p random Wishart matrix with n degrees of freedom and identity covariance matrix plays an important role in variou...