Sciweavers

168 search results - page 29 / 34
» Efficiently Detecting Inclusion Dependencies
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
BMCBI
2005
121views more  BMCBI 2005»
13 years 7 months ago
Quality control and quality assessment of data from surface-enhanced laser desorption/ionization (SELDI) time-of flight (TOF) ma
Background: Proteomic profiling of complex biological mixtures by the ProteinChip technology of surfaceenhanced laser desorption/ionization time-of-flight (SELDI-TOF) mass spectro...
Huixiao Hong, Yvonne P. Dragan, Joshua Epstein, Ca...
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
Optimizing amino acid substitution matrices with a local alignment kernel
Background: Detecting remote homologies by direct comparison of protein sequences remains a challenging task. We had previously developed a similarity score between sequences, cal...
Hiroto Saigo, Jean-Philippe Vert, Tatsuya Akutsu
DAGM
1999
Springer
13 years 11 months ago
Knowledge Discovery in Spatial Databases
Both, the number and the size of spatial databases, such as geographic or medical databases, are rapidly growing because of the large amount of data obtained from satellite images,...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
CASES
2005
ACM
13 years 9 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton