Sciweavers

3146 search results - page 18 / 630
» Efficient Consequence Finding
Sort
View
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
TWC
2008
120views more  TWC 2008»
13 years 7 months ago
Energy minimization of a QAM system with fading
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...
Raghavendra S. Prabhu, Babak Daneshrad
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001
TSMC
2002
144views more  TSMC 2002»
13 years 7 months ago
COR: a methodology to improve ad hoc data-driven linguistic rule learning methods by inducing cooperation among rules
This paper introduces a new learning methodology to quickly generate accurate and simple linguistic fuzzy models, the cooperative rules (COR) methodology. It acts on the consequent...
Jorge Casillas, Oscar Cordón, Francisco Her...
IWC
2007
100views more  IWC 2007»
13 years 7 months ago
Usefulness of VRML building models in a direction finding context
This paper describes an experiment which aims to examine the effectiveness and efficiency of a Virtual Reality Modelling Language (VRML) building model compared with equivalent ar...
Pietro Murano, Dino Mackey