5158 search results - page 283 / 1032 » Generalization of the Dempster-Shafer Theory |
169
click to vote
ECAI
2004
Springer
16 years 1 days ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
197
click to vote
GG
2004
Springer
16 years 1 days ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
165
click to vote
WWW
2010
ACM
15 years 12 months ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
180
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
171
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...