1060 search results - page 51 / 212 » On the Discovery of Random Trees |
CVPR
2008
IEEE
16 years 21 hour ago
2008
IEEE
Objects in the world can be arranged into a hierarchy based on their semantic meaning (e.g. organism ? animal ? feline ? cat). What about defining a hierarchy based on the visual ...
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
COMBINATORICS
2000
14 years 9 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
LOGCOM
2007
14 years 10 months ago
2007
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
SODA
2012
ACM
13 years 13 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...