24 search results - page 3 / 5 » Connectivity in the regular polytope representation |
LATA
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
IWDC
2005
Springer
13 years 11 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...
IJFCS
2010
13 years 3 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (...
NIPS
2001
13 years 6 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...