5607 search results - page 174 / 1122 » Graph structure in the Web |
156
Voted
ESWS
2005
Springer
15 years 11 months ago
2005
Springer
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
165
click to vote
ECWEB
2007
Springer
16 years 9 days ago
2007
Springer
Service matchmaking is the process of finding appropriate services for a given set of requirements. We present a novel service matchmaking approach based on the internal process o...
152
Voted
ECIR
2010
Springer
15 years 7 months ago
2010
Springer
We present two methods for estimating replacement probabilities without using parallel corpora. The first method proposed exploits the possible translation probabilities latent in ...
143
click to vote
SODA
1996
ACM
15 years 7 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
147
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
The extended abstract describes a method for recognizing similar sub-parts of objects described by 3D polygonal meshes. The innovation of this method is the coupling of structure a...