Sciweavers

364 search results - page 5 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
ICALP
2003
Springer
14 years 16 days ago
Scaled Dimension and Nonuniform Complexity
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
IPL
2006
93views more  IPL 2006»
13 years 7 months ago
A decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
Salvatore Caporaso
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
14 years 25 days ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
CORR
2000
Springer
134views Education» more  CORR 2000»
13 years 7 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
FOIKS
2004
Springer
14 years 21 days ago
Equivalence of OLAP Dimension Schemas
Abstract. Dimension schemas are abstract models of the data hierarchies that populate OLAP warehouses. Although there is abundant work on schema equivalence in a variety of data mo...
Carlos A. Hurtado, Claudio Gutiérrez