نتایج جستجو برای: d tree
تعداد نتایج: 737006 فیلتر نتایج به سال:
In this article we introduce some modifications over the Penniless propagation algorithm. When a message through the join tree is approximated, the corresponding error is quantified in terms of an improved information measure, which leads to a new way of pruning several values in a probability tree (representing a message) by a single one, computed from the value stored in the tree being pruned...
Multidimensional similarity join finds pairs of multidimensional points that are within some small distance of each other. The -k-d-B tree has been proposed as a data structure that scales better as the number of dimensions increases compared to previous data structures. We present a cost model of the -k-d-B tree and use it to optimize the leaf
This paper discusses an approach to automating C A D model acquisition b y creating Binary Space Partitioning (BSP trees f rom laser range d a t a . Distinct are then merged using set operations. BSP trees have proven their utility in 3-D modeling, graphics and ima g e processing, and their tree structure allows ef ic ient algorithms to be developed that are compact and numerically robust. Thes...
The denoising of video data should take into account both temporal and spatial dimensions, however, true 3D transforms are rarely used for video denoising. Separable 3-D transforms have artifacts that degrade their performance in applications. This paper describes the design and application of the non-separable oriented 3-D dual-tree wavelet transform for video denoising. This transform gives a...
We refer to [4], [8] for basic definitions and terminology in graph theory. A tree is a simple connected graph without any circuit. We consider trees in which each edge is replaced by two arcs in either direction. In this paper, such trees are called bidirected trees. We now introduce some notation. Let e,0 be the column vectors consisting of all ones and all zeros, respectively, of the appropr...
Tree nuts, peanuts and seeds are nutrient dense foods whose intake has been shown to be associated with reduced risk of some chronic diseases. They are regularly consumed in European diets either as whole, in spreads or from hidden sources (e.g. commercial products). However, little is known about their intake profiles or differences in consumption between European countries or geographic regio...
A decision tree recursively splits a feature space \mathbb{R}^d and then assigns class labels based on the resulting partition. Decision trees have been part of basic machine-learning toolkit for decades. large body work considers heuristic algorithms that compute from training data, usually aiming to minimize in particular size tree. In contrast, little is known about complexity underlying com...
The ordering of basic events is critical to fault tree analysis on the basis of binary decision diagrams (BDDs). Many attempts have been made to seek an efficient ordering result with the aim of reducing the complexity of BDD. In this article, a new ordering method, namely, priority ordering method, is proposed. The new method takes into account not only the effects of the layers of fault tree ...
We present an application of the measure of total uncertainty on convex sets of probability distributions, also called credal sets, to the construction of classification trees. In these classification trees the probabilities of the classes in each one of its leaves is estimated by using the imprecise Dirichlet model. In this way, smaller samples give rise to wider probability intervals. Branchi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید