214 search results - page 13 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
83
Voted
ESA
1998
Springer
15 years 2 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
EACL
2006
ACL Anthology
14 years 11 months ago
2006
ACL Anthology
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
STOC
2000
ACM
15 years 2 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
122
click to vote
STOC
1994
ACM
15 years 2 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
112
click to vote
ICCAD
2010
IEEE
14 years 8 months ago
2010
IEEE
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...