214 search results - page 8 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
102
click to vote
INFORMATICALT
2010
14 years 5 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
CORR
2010
Springer
14 years 5 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...