1039 search results - page 145 / 208 » Kernels and Regularization on Graphs |
144
Voted
NHM
2010
14 years 10 months ago
2010
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
107
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
123
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
109
click to vote
INFORMATICALT
2006
15 years 3 months ago
2006
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
145
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...