Sciweavers

1826 search results - page 5 / 366
» Using Random Forests in the Structured Language Model
Sort
View
LATA
2009
Springer
14 years 2 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
ICPR
2010
IEEE
14 years 1 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...
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
13 years 11 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
ECCV
2008
Springer
14 years 9 months ago
Segmentation and Recognition Using Structure from Motion Point Clouds
We propose an algorithm for semantic segmentation based on 3D point clouds derived from ego-motion. We motivate five simple cues designed to model specific patterns of motion and 3...
Gabriel J. Brostow, Jamie Shotton, Julien Fauqueur...