Related papers: An efficient search strategy for hidden ideals in …
Optimal search strategies where targets are observed at several different angles are found. Targets are assumed to exhibit rectangular symmetry and have a uniformly-distributed orientation. By rectangular symmetry, it is meant that one side…
The N cardinality k ideals of any w-element poset (w, k variable) can be enumerated in time O(Nw^3). The corresponding bound for k-element subtrees of a w-element tree is O(Nw^5). An algorithm is described that by the use of wildcards…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Though effective in the segmentation, conventional multilevel thresholding methods are computationally expensive as exhaustive search are used for optimal thresholds to optimize the objective functions. To overcome this problem,…
We consider the problem of exploring an unknown tree with a team of $k$ initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than $B$ edges. The goal is to maximize the number of nodes…
Using the existence of a good leaf in every simplicial tree, we order the facets of a simplicial tree in order to find combinatorial information about the Betti numbers of its facet ideal. Applications include an Eliahou-Kervaire splitting…
We consider the problem of classification of points sampled from an unknown probability measure on a Euclidean space. We study the question of querying the class label at a very small number of judiciously chosen points so as to be able to…
The problem of detecting anomalies in multiple processes is considered. We consider a composite hypothesis case, in which the measurements drawn when observing a process follow a common distribution with an unknown parameter (vector), whose…
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some…
The main contribution of this paper is the development of a new decision tree algorithm. The proposed approach allows users to guide the algorithm through the data partitioning process. We believe this feature has many applications but in…
We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…
An access structure is said to be multipartite, if the set of participants is divided into several parts and all participants in the same part play an equivalent role. The search for ideal secret sharing schemes for some special interesting…
Revision of the paper previously entitled "Learning a Machine for the Decision in a Partially Observable Markov Universe" In this paper, we are interested in optimal decisions in a partially observable universe. Our approach is to directly…
We consider generalizations of the classical secretary problem, also known as the problem of optimal choice, to posets where the only information we have is the size of the poset and the number of maximal elements. We show that, given this…
Pandora's problem is a fundamental model in economics that studies optimal search strategies under costly inspection. In this paper we initiate the study of Pandora's problem with combinatorial costs, capturing many real-life scenarios…
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit…
Finding optimal evolutionary trees from sequence data is typically an intractable problem, and there is usually no way of knowing how close to optimal the best tree from some search truly is. The problem would seem to be particularly acute…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
Active Object Recognition (AOR) has been approached as an unsupervised learning problem, in which optimal trajectories for object inspection are not known and are to be discovered by reducing label uncertainty measures or training with…
We address the problem of searching for a change point in an anomalous process among a finite set of M processes. Specifically, we address a composite hypothesis model in which each process generates measurements following a common…