We consider the general problem of enumerating branched covers projective line from a fixed curve subject to ramification conditions at possibly moving points. Our main computations are in genus 1; theory limit linear series allows one reduce this case. first obtain simple formula for weighted count pencils on elliptic <mml:math xmlns...

A Dung argumentation framework (AF) is a pair (A,R): A is a set of abstract arguments and R ⊆ A× A is a binary relation, so-called the attack relation, for capturing the conflicting arguments. “Labeling” based algorithms for enumerating extensions (i.e. sets of acceptable arguments) have been set out such that arguments (i.e. elements of A) are the only subject for labeling. In this paper we pr...

We investigate whether the pseudo-intents of a given formal context can efficiently be enumerated. We show that they cannot be enumerated in a specified lexicographic order with polynomial delay unless p = np. Furthermore we show that if the restriction on the order of enumeration is removed, then the problem becomes at least as hard as enumerating minimal transversals of a given hypergraph. We...

Articulatory suppression (repeatedly pronouncing a syllable or word while carrying out another task) is thought to interfere selectively with the phonological store in working memory. Although suppression interferes with temporal enumeration (enumerating successive light flashes), to date there has been little evidence of such interference in spatial enumeration (enumerating units laid out in s...

We consider the problem of enumerating all extreme points of a given set P of n points in d dimensions. We present an algorithm with O(n) space and O(nm) time where m is the number of extreme points of P. We also present an algorithm to compute the depth of each point of the given set of n points in d-dimensions. This algorithm has complexity O(n 2) which signiicantly improves the O(n 3) comple...

This paper presents a formal framework for investigating keyword proximity search. Within this framework, three variants of keyword proximity search are defined. For each variant, there are algorithms for enumerating all the results in an arbitrary order, in the exact order and in an approximate order. The algorithms for enumerating in the exact order make the inevitable assumption that the siz...