779 search results - page 53 / 156 » Algorithms for the Sample Mean of Graphs |
114
click to vote
PAMI
2010
15 years 2 months ago
2010
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language pr...
111
click to vote
WEBI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
125
click to vote
JDA
2007
15 years 4 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
166
click to vote
KAIS
2011
14 years 11 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
150
click to vote
PAMI
2007
15 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...