4074 search results - page 289 / 815 » Defining Computational Aesthetics |
283
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
176
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
147
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
167
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
359
click to vote
VLDB
2006
ACM
16 years 6 months ago
2006
ACM
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...