Sciweavers

916 search results - page 22 / 184
» Using redundancies to find errors
Sort
View
AAAI
2000
14 years 8 days ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
CCR
2008
94views more  CCR 2008»
13 years 11 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
14 years 4 months ago
Benefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
Anne M. Raich, Tamás Liszkai
BMCBI
2010
151views more  BMCBI 2010»
13 years 11 months ago
Classification of G-protein coupled receptors based on support vector machine with maximum relevance minimum redundancy and gene
Background: Because a priori knowledge about function of G protein-coupled receptors (GPCRs) can provide useful information to pharmaceutical research, the determination of their ...
Zhanchao Li, Xuan Zhou, Zong Dai, Xiaoyong Zou
ISMB
1998
14 years 8 days ago
Automated Clustering and Assembly of Large EST Collections
The avMlability of large EST(Expressed Sequence Tag)databases has led to a revolution in the waynew genes are cloned. Difficulties arise, however,due to high error rates and redun...
David P. Yee, Darrell Conklin