Sciweavers

720 search results - page 106 / 144
» Linear k-arboricities on trees
Sort
View
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 9 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
JODL
2000
114views more  JODL 2000»
13 years 9 months ago
Integrating ontologies and thesauri for RDF schema creation and metadata querying
In this paper we present a new approach for building metadata schemas by integrating existing ontologies and structured vocabularies (thesauri). This integration is based on the s...
Bernd Amann, Irini Fundulaki, Michel Scholl
TIT
1998
123views more  TIT 1998»
13 years 9 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
13 years 8 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
FSTTCS
2010
Springer
13 years 8 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet