1805 search results - page 123 / 361 » A Theory of Closure Operators |
149
Voted
POPL
2012
ACM
14 years 5 days ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
136
click to vote
EUROCAST
2005
Springer
15 years 10 months ago
2005
Springer
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...
175
click to vote
DFG
1992
Springer
15 years 8 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
174
Voted
FP
1991
15 years 8 months ago
1991
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
129
click to vote
DATAMINE
1998
15 years 4 months ago
1998
We present a rigorous framework, based on optimization, for evaluating data mining operations such as associations and clustering, in terms of their utility in decisionmaking. Thi...