230 search results - page 10 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
FOSSACS
2009
Springer
14 years 2 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...
IPCO
2010
13 years 5 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
ICML
2006
IEEE
14 years 8 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...
INFORMATICALT
2010
13 years 2 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...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...