1068 search results - page 145 / 214 » Extremely randomized trees |
142
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
113
click to vote
ALMOB
2007
15 years 3 months ago
2007
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
115
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Prior distributions are useful for robust low-level vision, and undirected models (e.g. Markov Random Fields) have become a central tool for this purpose. Though sometimes these p...
104
click to vote
ISBI
2008
IEEE
16 years 3 months ago
2008
IEEE
We present here a method giving a robust segmentation for in vitro cells observed under standard phase-contrast microscopy. We tackle the problem using the watershed transform. Wa...
196
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...