230 search results - page 5 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
COLING
2008
13 years 9 months ago
2008
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
IPL
2006
13 years 7 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
PLDI
1994
ACM
13 years 11 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...