CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
: This paper addresses the problem of reconstructing an image from 1-bit-quantized measurements, considering a simple but nonconventional optical acquisition model. Following a com...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...