251 search results - page 3 / 51 » Constructive Linear Time Algorithms for Branchwidth |
COMPGEOM
2005
ACM
14 years 24 days ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
ESA
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
COMPGEOM
1993
ACM
14 years 3 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...