5158 search results - page 385 / 1032 » Generalization of the Dempster-Shafer Theory |
233
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
173
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
176
click to vote
PADL
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
178
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
Two-sided markets arise when two different types of users may realize gains by interacting with one another through one or more platforms or mediators. We initiate a study of the...
159
click to vote
SIGCSE
2009
ACM
16 years 1 months ago
2009
ACM
Many courses on the history of computing are designed for a general student audience, and as such, include fewer technical details than one might find in a typical CS course. Whi...