5158 search results - page 328 / 1032 » Generalization of the Dempster-Shafer Theory |
213
Voted
LOGCOM
2010
15 years 5 months ago
2010
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
184
Voted
KDD
2009
ACM
16 years 7 months ago
2009
ACM
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
326
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
162
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
229
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...