Join Our Newsletter

JSC

2010

11 years 6 days ago
2010

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...

DLT

2009

11 years 3 months ago
2009

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...

SAC

2008

ACM

11 years 4 months ago
2008

ACM

The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...

IJAC

2000

11 years 5 months ago
2000

For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W. This monoid is denoted by...

TSP

2008

11 years 5 months ago
2008

The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...

COMBINATORICS

2006

11 years 5 months ago
2006

We give a simpler proof of the result of Boros and F

COMBINATORICS

2006

11 years 5 months ago
2006

In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid. A layer is the set of grid cells that are vertex-adjacent to the ...

EJC

2008

11 years 5 months ago
2008

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure ...

EJC

2010

11 years 5 months ago
2010

Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...

CORR

2010

Springer

11 years 5 months ago
2010

Springer

We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...