523 search results - page 48 / 105 » Decidability of string graphs |
144
Voted
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Trust and reputation measures are crucial in distributed open systems where agents need to decide whom or what to choose. Existing work has mainly focused on the reputation of sing...
119
Voted
JGAA
2006
15 years 3 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
137
click to vote
ICCS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
144
click to vote
FQAS
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
123
Voted
ESWS
2006
Springer
15 years 7 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...