1805 search results - page 323 / 361 » A Theory of Closure Operators |
147
click to vote
WWW
2003
ACM
16 years 4 months ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
364
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
153
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
131
click to vote
CHI
2009
ACM
16 years 4 months ago
2009
ACM
Over the past few years, a quiet revolution has been redefining our fundamental computing technologies. Flexible E-Ink, OLED displays, shape-changing materials, parametric design,...
245
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...