5316 search results - page 162 / 1064 » Which Search Problems Are Random |
126
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
131
click to vote
JAR
2008
15 years 3 months ago
2008
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
140
Voted
CIBCB
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
139
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
119
Voted
STACS
2004
Springer
15 years 9 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...