15033 search results - page 137 / 3007 » Complexity Theory and Algorithms |
120
Voted
IPL
2008
15 years 3 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
150
click to vote
ICONIP
2008
15 years 5 months ago
2008
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
148
Voted
IJSI
2010
15 years 2 months ago
2010
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
134
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we propose a new implementation of the EMS decoder for non binary LDPC codes presented in [7]. A particularity of the new algorithm is that it takes into account...
131
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Owing to the great computation complexity of the ME (motion estimation) in video coding, a lot of fast ME algorithms have been proposed in literature. Most of them are designed ba...