315 search results - page 4 / 63 » Better Approximation of Betweenness Centrality |
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
AIED
2005
Springer
14 years 1 months ago
2005
Springer
Abstract: The problem of modeling and assessing an individual’s ability level is central to learning environments. Numerous approaches exists to this end. Computer Adaptive Testi...
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...