CORR
2007
Springer
13 years 8 months ago
2007
Springer
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Data from spectrophotometers form vectors of a large number of exploitable variables. Building quantitative models using these variables most often requires using a smaller set of...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
In this paper, an educational software aimed to help learning Information Theory basics in a practical way is reported. The software, called IT-tutor-UV, can produce entropy analy...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Consider partial maps Σ∗ −→ with a rational domain. We show that two families of such series are actually the same: the unambiguous rational series on the one hand, and ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract—In this letter, we consider the problem of resource allocation between two competing users sharing a binary symmetric broadcast channel. We model the interaction between...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We propose a range of deep lexical acquisition methods which make use of morphological, syntactic and ontological language resources to model word similarity and bootstrap from a ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of informati...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...