1805 search results - page 70 / 361 » A Theory of Closure Operators |
125
click to vote
PVLDB
2010
14 years 11 months ago
2010
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
143
click to vote
CONCUR
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
160
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
145
click to vote
ICFCA
2004
Springer
15 years 9 months ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
127
click to vote
ICSE
2001
IEEE-ACM
15 years 8 months ago
2001
IEEE-ACM
We present a foundational theory of software system reliability based on components. The theory describes how component developers can design and test their components to produce ...