Sciweavers

1060 search results - page 91 / 212
» On the Discovery of Random Trees
Sort
View
91
Voted
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
14 years 11 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
104
Voted
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 3 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
86
Voted
ICPR
2010
IEEE
15 years 3 months ago
On-Line Random Naive Bayes for Tracking
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
Martin Godec, Christian Leistner, Amir Saffari, Ho...
IBPRIA
2007
Springer
15 years 2 months ago
Random Forest for Gene Expression Based Cancer Classification: Overlooked Issues
Random forest is a collection (ensemble) of decision trees. It is a popular ensemble technique in pattern recognition. In this article, we apply random forest for cancer classifica...
Oleg Okun, Helen Priisalu
TDP
2010
124views more  TDP 2010»
14 years 8 months ago
Random Forests for Generating Partially Synthetic, Categorical Data
Abstract. Several national statistical agencies are now releasing partially synthetic, public use microdata. These comprise the units in the original database with sensitive or ide...
Gregory Caiola, Jerome P. Reiter