نتایج جستجو برای: tree attribute
تعداد نتایج: 237983 فیلتر نتایج به سال:
We present a novel approach in machine learning by combining naı̈ve Bayes classifiers with tree kernels. Tree kernel methods produce promising results in machine learning tasks containing treestructured attribute values. These kernel methods are used to compare two tree-structured attribute values recursively. Up to now tree kernels are only used in kernel machines like Support Vector Machines o...
The requirements for up-to-date tree data in city parks and forests are increasing, and an important question is how to keep the digital databases current for various applications. Traditional map-updating procedures, such as visual interpretation of digital aerial images or field measurements using tachymeters, are either inaccurate or expensive. Recently, the development of laser-scanning tec...
The hB-pi tree is a multi-attribute index method which combines the hB tree, a multi-attribute access structure and the II-tree, an abstract index with efficient concurrency and recovery methods. The hB-pi tree is a balanced tree and adapts well to different data distributions. Furthermore, the hB-pi tree inherits the efficient concurrency and recovery methods from the II tree. This paper provi...
A characterization is given of the class of tree translations definable in monadic second-order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs) with regular look-ahead that are single use restricted. For this the single use restriction known from attri...
Attribute grammars provide a framework to define computations over trees, by decorating those trees with attributes. Attribute grammars have been successfully applied in many areas, including compiler construction and natural language processing. In this paper we present a translation of attribute grammars to Constraint Handling Rules, a formalism based on constraint rewriting. Our translation ...
Most decision-tree induction algorithms are using a local greedy strategy, where a leaf is always split on the best attribute according to a given attribute selection criterion. A more accurate model could possibly be found by looking ahead for alternative subtrees. However, some researchers argue that the look-ahead should not be used due to a negative effect (called ―decision tree pathology‖)...
A decision tree can be used for clustering of frequently used attributes to improve tuple reconstruction time in column-stores databases. Due to ad-hoc nature of queries, strongly correlative attributes are grouped together using a decision tree to share a common minimum support probability distribution. At the same time in order to predict the cluster for unseen attribute set, the decision tre...
In this paper, we present a new denotational semantics of attribute grammars (AGs) by using Cardelli's record calculus. This new denotational semantics is simple, natural and structure-oriented. AGs have been considered useful in describing interactive programming environments as well as in specifying the semantics of programming languages. Using AGs, interactive programming environments are of...
Syntax Tree run attribute evaluator run LALR(1) parser Textual Constraints Concrete Syntax Tree Model constraints loaded [no evaluation errors] hasModelAndCst model loaded
DHT based peer to peer network system is a general range of query scheme. These schemes can support the range of query without modifying the underlying DHTs and they cannot guarantee to return the query results with bounded delay. The query delay in these schemes depends on both the scale of the system and the size of the query space. This paper, proposed Armada, an efficient range of query pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید