Related papers: A Nice Labelling for Tree-Like Event Structures of…
Most of the approaches for indoor RGBD semantic la- beling focus on using pixels or superpixels to train a classi- fier. In this paper, we implement a higher level segmentation using a hierarchy of superpixels to obtain a better segmen-…
Images of scenes have various objects as well as abundant attributes, and diverse levels of visual categorization are possible. A natural image could be assigned with fine-grained labels that describe major components, coarse-grained labels…
A large volume of accident reports is recorded in the aviation domain, which greatly values improving aviation safety. To better use those reports, we need to understand the most important events or impact factors according to the accident…
Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. Very limited results on this conjecture are known. In this paper, we proposed a…
We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
This paper reduces discontinuous parsing to sequence labeling. It first shows that existing reductions for constituent parsing as labeling do not support discontinuities. Second, it fills this gap and proposes to encode tree discontinuities…
An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is relevant. The edit distance between two ordered labeled trees is the minimum cost of changing one tree into the other through a…
We introduce a cluster evaluation technique called Tree Index. Our Tree Index algorithm aims at describing the structural information of the clustering rather than the quantitative format of cluster-quality indexes (where the representation…
Working over a field of characteristic zero, we give structure theorems for all grade three licci ideals and their minimal free resolutions. In particular, we completely classify such ideals up to deformation. The descriptions of their…
A good edge-labeling of a graph [Ara\'ujo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there exist two non-decreasing paths. In this paper, we study…
A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and…
Consider the following game. We are given a tree $T$ and two players (say) Alice and Bob who alternately colour an edge of a tree (using one of $k$ colours). If all edges of the tree get coloured, then Alice wins else Bob wins. Game…
A learning algorithm is presented which given the structure of a causal tree, will estimate its link probabilities by sequential measurements on the leaves only. Internal nodes of the tree represent conceptual (hidden) variables…
Reasoning about real-life events is a unifying challenge in AI and NLP that has profound utility in a variety of domains, while fallacy in high-stake applications could be catastrophic. Able to work with diverse text in these domains, large…
A Concept Tree is a structure for storing knowledge where the trees are stored in a database called a Concept Base. It sits between the highly distributed neural architectures and the distributed information systems, with the intention of…
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj . A coloring is a Grundy…