Sciweavers

1068 search results - page 145 / 214
» Extremely randomized trees
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 2 months ago
Minimum Cuts in Near-Linear Time
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...
David R. Karger
ALMOB
2007
151views more  ALMOB 2007»
13 years 10 months ago
Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail
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...
Stefan Wolfsheimer, Bernd Burghardt, Alexander K. ...
CVPR
2008
IEEE
15 years 18 hour ago
Who killed the directed model?
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...
Justin Domke, Alap Karapurkar, Yiannis Aloimonos
ISBI
2008
IEEE
14 years 10 months ago
Phase contrast image segmentation by weak watershed transform assembly
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...
Olivier Debeir, Ivan Adanja, Nadine Warzée,...
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
14 years 10 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...