Sciweavers

4860 search results - page 343 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
125
Voted
TCOM
2010
133views more  TCOM 2010»
14 years 10 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
ICPP
2000
IEEE
15 years 7 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
142
Voted
BMCBI
2004
151views more  BMCBI 2004»
15 years 3 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 10 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
15 years 9 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello