5244 search results - page 97 / 1049 » Structural Complexity of AvgBPP |
FQAS
2006
Springer
14 years 18 days ago
2006
Springer
Abstract. When querying XML collections, users cannot always express their need in a precise way. Systems should therefore support vagueness at both the content and structural leve...
PODC
2010
ACM
14 years 25 days ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
DMDW
2003
13 years 10 months ago
2003
: Two main problems arise in modelling data warehouse structures. The first consists in establishing an adequate representation of dimensions in order to facilitate and to control ...
CAS
2008
13 years 9 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...