419 search results - page 37 / 84 » First Order Paths in Ordered Trees |
ALGORITHMICA
2010
13 years 10 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
MFCS
1998
Springer
14 years 2 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
BROADNETS
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— In this paper, we address the problem of video multicasting in ad hoc wireless networks. The salient characteristics of video traffic make conventional multicasting pr...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
ICCV
1999
IEEE
14 years 11 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...