Sciweavers

25 search results - page 1 / 5
» Towards an optimal weighting of context words based on dista...
Sort
View
COLING
2010
12 years 12 months ago
Towards an optimal weighting of context words based on distance
Word Sense Disambiguation (WSD) often relies on a context model or vector constructed from the words that co-occur with the target word within the same text windows. In most cases...
Bernard Brosseau-Villeneuve, Jian-Yun Nie, Noriko ...
DAS
2010
Springer
13 years 9 months ago
Towards more effective distance functions for word image matching
Matching word images has many applications in document recognition and retrieval systems. Dynamic Time Warping (DTW) is popularly used to estimate the similarity between word imag...
Raman Jain, C. V. Jawahar
NETWORK
2010
122views more  NETWORK 2010»
12 years 11 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
IAT
2006
IEEE
13 years 11 months ago
Representing Context for Multiagent Trust Modeling
We present a universal mechanism that can be combined with existing trust models to extend their capabilities towards efficient modelling of the situational (contextdependent) tr...
Martin Rehák, Milos Gregor, Michal Pechouce...
GBRPR
2009
Springer
13 years 11 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone