Related papers: Relating decision and search algorithms for ration…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
We consider the locus of irreducible nonsingular rational curves of degree d Pn, n>2, meeting a generic collection of linear subspaces. When this locus is 0 (resp 1)- dimensional, we compute (recursively) its degree (resp. geometric genus).…
We consider algorithmic approaches to the D-optimality problem for cases where the input design matrix is large and highly structured, in particular implicitly specified as a full quadratic or linear response-surface model in several levels…
We describe a probabilistic (generative) view of affinity matrices along with inference algorithms for a subclass of problems associated with data clustering. This probabilistic view is helpful in understanding different models and…
This paper makes a number of connections between life and various facets of genetic and evolutionary algorithms research. Specifically, it addresses the topics of adaptation, multiobjective optimization, decision making, deception, and…
We study genus one curves that arise as 2-, 3- and 4-coverings of elliptic curves. We describe efficient algorithms for testing local solubility and modify the classical formulae for the covering maps so that they work in all…
The method for analyzing algorithmic runtime complexity using decision trees is discussed using the sorting algorithm. This method is then extended to optimal algorithms which may find all cliques of size q in network N, or simply the first…
The history of learning for control has been an exciting back and forth between two broad classes of algorithms: planning and reinforcement learning. Planning algorithms effectively reason over long horizons, but assume access to a local…
Given a real algebraic curve, embedded in projective space, we study the computational problem of deciding whether there exists a hyperplane meeting the curve in real points only. More generally, given any divisor on such a curve, we may…
Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…
The paper presents a comprehensive performance evaluation of some heuristic search algorithms in the context of autonomous systems and robotics. The objective of the study is to evaluate and compare the performance of different search…
In this note we present a fast algorithm that finds for any $r$ the number $N_r$ of $\mathbb{F}_{q^r}$ rational points on a smooth absolutely irreducible curve $C$ defined over $\mathbb{F}_{q}$ assuming that we know $N_1,\cdots,N_g$, where…
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…
We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…
Beam search is a go-to strategy for decoding neural sequence models. The algorithm can naturally be viewed as a subset optimization problem, albeit one where the corresponding set function does not reflect interactions between candidates.…
With the development of connected filters for the last decade, many algorithms have been proposed to compute the max-tree. Max-tree allows to compute the most advanced connected operators in a simple way. However, no fair comparison of…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
We study the stable pairs theory of local curves in 3-folds with descendent insertions. The rationality of the partition function of descendent invariants is established for the full local curve geometry (equivariant with respect to the…
Due to the complexity of many decision making problems, tree search algorithms often have inadequate information to produce accurate transition models. This results in ambiguities (uncertainties for which there are multiple plausible…
We prove that any smooth rational projective surface over the field of complex numbers has an open covering consisting of 3 subsets isomorphic to affine planes.