CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Debugging is an important prerequisite for the wide-spread application of ontologies, especially in areas that rely upon everyday users to create and maintain knowledge b...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. H...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Knowledge-based programs provide an abstract level of description of protocols in which agent actions are related to their states of knowledge. The paper describes how epistemic mo...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We consider minimal-rate sampling schemes for streams of delayed and weighted versions of a known pulse shape. Such signals belong to the class of finite rate of innovation (FRI) m...
CORR
2010
Springer
13 years 11 months ago
2010
Springer