2436 search results - page 353 / 488 » Comonadic Notions of Computation |
136
click to vote
CALCO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
146
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
130
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
117
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
115
click to vote
EMSOFT
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...