Sciweavers

3047 search results - page 87 / 610
» Randomized Parallel Selection
Sort
View
FLAIRS
2007
14 years 12 days ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
BILDMED
2008
147views Algorithms» more  BILDMED 2008»
13 years 11 months ago
Automatic Liver Segmentation Using the Random Walker Algorithm
In this paper we present a new method for fully automatic liver segmentation in computed tomography images. First, an initial set of seed points for the random walker algorithm is ...
Florian Maier, Andreas Wimmer, Grzegorz Soza, Jens...
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 10 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li
TCOM
2008
116views more  TCOM 2008»
13 years 10 months ago
Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
Chintha Tellambura
PAMI
1998
127views more  PAMI 1998»
13 years 9 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho