Sciweavers

1449 search results - page 194 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
PR
2006
127views more  PR 2006»
15 years 6 months ago
Unsupervised possibilistic clustering
In fuzzy clustering, the fuzzy c-means (FCM) clustering algorithm is the best known and used method. Since the FCM memberships do not always explain the degrees of belonging for t...
Miin-Shen Yang, Kuo-Lung Wu
IJAC
2007
116views more  IJAC 2007»
15 years 6 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
TCOM
2008
127views more  TCOM 2008»
15 years 6 months ago
Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
Daniel N. Liu, Michael P. Fitz
BMCBI
2005
106views more  BMCBI 2005»
15 years 6 months ago
Thesaurus-based disambiguation of gene symbols
Background: Massive text mining of the biological literature holds great promise of relating disparate information and discovering new knowledge. However, disambiguation of gene s...
Bob J. A. Schijvenaars, Barend Mons, Marc Weeber, ...
TKDE
2008
136views more  TKDE 2008»
15 years 6 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng