16430 search results - page 178 / 3286 » On Computable Tree Functions |
151
click to vote
IWOCA
2010
Springer
14 years 10 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
124
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper describes a novel Recursive Neural Network for adaptive processing of FacE Emotion Tree Structures (FEETS). We proposed to use tree structures to represent Gabor Face E...
115
click to vote
CHI
2006
ACM
16 years 4 months ago
2006
ACM
We present PygmyBrowse, a browser that allows users to navigate a tree data structure in a limited amount of display space. A pilot evaluation of PygmyBrowse was conducted, and re...
177
Voted
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
114
click to vote
GD
2008
Springer
15 years 4 months ago
2008
Springer
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of dir...