Sciweavers

1722 search results - page 116 / 345
» Variables in Concept Graphs
Sort
View
COLING
2008
14 years 11 months ago
Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
Holger Wunsch
ICWS
2007
IEEE
14 years 11 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni
COLING
1996
14 years 11 months ago
Processing Metonymy- a Domain-Model Heuristic Graph Traversal Approach
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a co...
Jacques Bouaud, Bruno Bachimont, Pierre Zweigenbau...
CORR
2010
Springer
124views Education» more  CORR 2010»
14 years 10 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
IPL
2011
63views more  IPL 2011»
14 years 4 months ago
Edge-colored graphs with applications to homogeneous faults
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
Yongge Wang, Yvo Desmedt