Sciweavers

1287 search results - page 125 / 258
» The Computation of Semantic Data Cube
Sort
View
ICEIS
2003
IEEE
14 years 3 months ago
Formalizing Types with Ultimate Closure for Middleware Tools in Information Systems Engineering
: A definition of types in an information system is given from real-world abstractions through data constructs, schema and definitions to physical data values. Category theory su...
B. Nick Rossiter, David A. Nelson, Michael A. Heat...
ECOOPW
1999
Springer
14 years 2 months ago
Outdating Outdated Objects
In many application scenarios the database is changing quite rapidly. Because the management of such data is rather expensive and cumbersome, many applications like data warehouse...
Holger Riedel
GD
1994
Springer
14 years 2 months ago
A Geometrical Heuristic for Drawing Concept Lattices
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
Gerd Stumme, Rudolf Wille
LICS
2005
IEEE
14 years 3 months ago
Operational Domain Theory and Topology of a Sequential Programming Language
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this,...
Martín Hötzel Escardó, Weng Kin...
IBPRIA
2007
Springer
14 years 2 months ago
Efficiently Downdating, Composing and Splitting Singular Value Decompositions Preserving the Mean Information
Three methods for the efficient downdating, composition and splitting of low rank singular value decompositions are proposed. They are formulated in a closed form, considering the ...
Javier Melenchón, Elisa Martínez