2492 search results - page 134 / 499 » On the General Signature Trees |
214
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Many state-of-the-art face recognition algorithms use image descriptors based on features known as Local Binary Patterns (LBPs). While many variations of LBP exist, so far none of ...
175
click to vote
RSA
2011
14 years 9 months ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
165
click to vote
ACL
2012
13 years 8 months ago
2012
We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dir...
162
click to vote
SMI
2005
IEEE
16 years 3 hour ago
2005
IEEE
We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a threedimensional scalar field based on unstructured tetrahedral meshes. Such data s...
169
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...