518 search results - page 38 / 104 » Beating a Random Assignment |
126
click to vote
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
105
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
Bagging is an ensemble method that uses random resampling of a dataset to construct models. In classification scenarios, the random resampling procedure in bagging induces some c...
120
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
111
click to vote
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
15 years 2 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
101
click to vote
IPL
2000
15 years 2 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...