688 search results - page 4 / 138 » Types for trees |
TYPES
2004
Springer
14 years 22 days ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
JACM
2000
13 years 7 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
ICARIS
2003
Springer
14 years 18 days ago
2003
Springer
Abstract. The paper makes an attempt to introduce a new approach for detection of local singularities in signals, including one-dimensional time series and two-dimensional images. ...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
PLANX
2007
13 years 8 months ago
2007