Sciweavers

9842 search results - page 333 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICC
2007
IEEE
15 years 10 months ago
Low-Complexity, Low-Memory EMS Algorithm for Non-Binary LDPC Codes
— 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...
Adrian Voicila, David Declercq, François Ve...
AIIA
2007
Springer
15 years 10 months ago
Evolving Complex Neural Networks
Abstract. Complex networks like the scale-free model proposed by BarabasiAlbert are observed in many biological systems and the application of this topology to artificial neural ne...
Mauro Annunziato, Ilaria Bertini, Matteo De Felice...
GLOBECOM
2006
IEEE
15 years 10 months ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
ADMA
2006
Springer
127views Data Mining» more  ADMA 2006»
15 years 10 months ago
Feature Selection for Complex Patterns
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...
Peter Schenkel, Wanqing Li, Wanquan Liu
ICMCS
2005
IEEE
70views Multimedia» more  ICMCS 2005»
15 years 9 months ago
A Multimodal Complexity Comprehension-Time Framework for Automated Presentation Synthesis
In this paper, we present a joint multimodal (audio, visual and text) framework to map the informational complexity of the media elements to comprehension time. The problem is imp...
Harini Sridharan, Aankus Mani, Hari Sundaram