Sciweavers

548 search results - page 78 / 110
» Using the Genetic Algorithm to Find Snake-in-the-Box Codes
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
IJES
2006
110views more  IJES 2006»
13 years 7 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
RECOMB
2004
Springer
14 years 8 months ago
A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
Haifeng Li, Tao Jiang
AIPS
2010
13 years 8 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger
PAMI
2012
11 years 10 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens