Sciweavers

Share
JSC
2010
82views more  JSC 2010»
9 years 1 months ago
Linear complete differential resultants and the implicitization of linear DPPEs
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...
Sonia L. Rueda, J. Rafael Sendra
DLT
2009
9 years 4 months ago
On the Complexity of Deciding Avoidability of Sets of Partial Words
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...
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gu...
SAC
2008
ACM
9 years 6 months ago
Output-sensitive algorithms for Tukey depth and related problems
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...
David Bremner, Dan Chen, John Iacono, Stefan Lange...
IJAC
2000
70views more  IJAC 2000»
9 years 6 months ago
Finitely Based, Finite Sets of Words
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...
Marcel Jackson, Olga Sapir
TSP
2008
151views more  TSP 2008»
9 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
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...
Moshe Mishali, Yonina C. Eldar
COMBINATORICS
2006
125views more  COMBINATORICS 2006»
9 years 7 months ago
A Point in Many Triangles
We give a simpler proof of the result of Boros and F
Boris Bukh
COMBINATORICS
2006
122views more  COMBINATORICS 2006»
9 years 7 months ago
Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter
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 ...
Winston C. Yang
EJC
2008
9 years 7 months ago
Embeddability of arrangements of pseudocircles into the sphere
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 ...
Ronald Ortner
EJC
2010
9 years 7 months ago
Dualities in full homomorphisms
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...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr
CORR
2010
Springer
144views Education» more  CORR 2010»
9 years 7 months ago
Algorithmic Verification of Single-Pass List Processing Programs
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...
Rajeev Alur, Pavol Cerný
books