Sciweavers

8697 search results - page 363 / 1740
» Measures of Distributional Similarity
Sort
View
DKE
2008
96views more  DKE 2008»
15 years 6 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
SEMWEB
2007
Springer
16 years 27 days ago
An Empirical Study of Instance-Based Ontology Matching
Instance-based ontology mapping is a promising family of solutions to a class of ontology alignment problems. It crucially depends on measuring the similarity between sets of annot...
Antoine Isaac, Lourens van der Meij, Stefan Schlob...
IPPS
2006
IEEE
16 years 24 days ago
Detecting phases in parallel applications on shared memory architectures
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Erez Perelman, Marzia Polito, Jean-Yves Bouguet, J...
DEBS
2009
ACM
15 years 10 months ago
Efficient event-based resource discovery
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Ja...
CCA
2009
Springer
16 years 1 months ago
Random Iteration Algorithm for Graph-Directed Sets
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide...