Sciweavers

921 search results - page 158 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
DIMACS
1996
13 years 9 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 29 days ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 8 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
BMCBI
2008
135views more  BMCBI 2008»
13 years 8 months ago
Identification of a small optimal subset of CpG sites as bio-markers from high-throughput DNA methylation profiles
Background: DNA methylation patterns have been shown to significantly correlate with different tissue types and disease states. High-throughput methylation arrays enable large-sca...
Hailong Meng, Edward Lenn Murrelle, Guoya Li
PLDI
2004
ACM
14 years 1 months ago
Region inference for an object-oriented language
Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient us...
Wei-Ngan Chin, Florin Craciun, Shengchao Qin, Mart...