نتایج جستجو برای: tree based algorithms
تعداد نتایج: 3218928 فیلتر نتایج به سال:
Fast Fourier Transform (FFT) is widely used in signal processing applications. For a 2n-point FFT, split-radix FFT costs less mathematical operations than many state-of-the-art algorithms. Most split-radix FFT algorithms are implemented in a recursive way which brings much extra overhead of systems. In this paper, we propose an algorithm of split-radix FFT that can eliminate the system overhead...
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are interested in algorithms that can be used with any dissimilarity function provided that it fits the mathematical notion of distance. Some of such algorithms organize, in preprocessing time, the data in a tree structur...
We prove new structural properties for tree-decompositions of planar graphs that we use to improve upon the runtime of tree-decomposition based dynamic programming approaches for several NP-hard planar graph problems. We give for example the fastest algorithm for Planar Dominating Set of runtime 3 · n, when we take the treewidth tw as the measure for the exponential worst case behavior. We also...
This paper gives several optimal mesh computer, VLSI, and pyramid computer algorithms for determining properties of an arbitrary undirected graph, where the graph is given as an unordered collection of edges. The algorithms first find spanning trees and then use them to determine properties of the graph. By using edges, instead of requiring an entire adjacency matrix, these algorithms use only ...
Discovery of sequential patterns is becoming increasingly useful and essential in many scientific and commercial domains. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient, scalable, and parallel algorithms. Even though a number of algorithms have been developed to efficiently parallelize frequent pattern discovery algorithms that are based on the...
Westudy some structural properties for tree-decompositions of 2-connected planar graphs that we use to improve upon the runtime of tree-decomposition based dynamic programming approaches for several NP-hard planar graph problems. E.g., we derive the fastest algorithm for Planar Dominating Set of runtime 3tw · nO(1), when we take the width tw of a given tree-decomposition as the measure for the ...
Goal • Development of novel algorithms for stable, complete and admissible semantics, following up the work of Dvořák et.al. [1] • Based on Tree Decompositions, tractable • Evaluation of different types of Tree Decompositions Overview • Argumentation Frameworks (AFs) important reseach field in Artificial Intelligence • Selection of 'appropriate' arguments from AF defined by a semantics • Many d...
The wavelet coefficients of a 2D natural image are not only approximately sparse with a large number of coefficients tend to be zeros, but also yield a quadtree structure. According to structured sparsity theory, the required measurement bounds for compressive sensing reconstruction can be reduced to O(K+log(N/K)) by exploiting the tree structure rather than O(K+Klog(N/K)) for standard K-sparse...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید