1511 search results - page 155 / 303 » Randomness, lowness and degrees |
197
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
171
click to vote
HIS
2004
15 years 7 months ago
2004
With inspiration from psychophysical researches of the human visual system we propose a novel method for performance evaluation of contour based shape recognition algorithms. We u...
150
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
173
click to vote
TOC
2008
15 years 6 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
213
click to vote
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...