Sciweavers

6568 search results - page 305 / 1314
» Reducing the Complexity of Reductions
Sort
View
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 10 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
GLOBECOM
2008
IEEE
15 years 8 months ago
Towards the Performance of ML and the Complexity of MMSE - A Hybrid Approach
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...
Byonghyo Shim, Jun Won Choi, Insung Kang
ICECCS
2005
IEEE
87views Hardware» more  ICECCS 2005»
16 years 13 days ago
Scavenging Complex Genomic Information Using Mobile Code: An Evaluation
Mobile code solutions can improve the performances of applications over the Internet by reducing the amount of data that must be transferred across the network. The research on ge...
Mauro Pezzè, Davide Tosi, Gian Pietro Picco
ISCAS
2003
IEEE
111views Hardware» more  ISCAS 2003»
16 years 3 days ago
A 2048 complex point FFT processor using a novel data scaling approach
In this paper, a novel data scaling method for pipelined FFT processors is proposed. By using data scaling, the'FFT processor can operateon a wide range of input signals with...
Thomas Lenart, Viktor Öwall
CEAS
2004
Springer
15 years 10 months ago
Managing Customer Opt-Outs in a Complex Global Environment
The day to day rhetoric associated with spam control focuses on measures, technology, rules or fees to impose order or control. These efforts concentrate on the broad range of mess...
Matt Leonard, Mayra Rodriguez, Richard Segal, Robe...