Sciweavers

1018 search results - page 116 / 204
» Generative unbinding of names
Sort
View
CORR
2008
Springer
157views Education» more  CORR 2008»
13 years 9 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
BMCBI
2006
125views more  BMCBI 2006»
13 years 9 months ago
Evaluating different methods of microarray data normalization
Background: With the development of DNA hybridization microarray technologies, nowadays it is possible to simultaneously assess the expression levels of thousands to tens of thous...
André Fujita, João Ricardo Sato, Leo...
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 9 months ago
Similarity of Objects and the Meaning of Words
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti...
Rudi Cilibrasi, Paul M. B. Vitányi
TCAD
2008
183views more  TCAD 2008»
13 years 9 months ago
Systematic and Automated Multiprocessor System Design, Programming, and Implementation
Abstract--For modern embedded systems in the realm of highthroughput multimedia, imaging, and signal processing, the complexity of embedded applications has reached a point where t...
Hristo Nikolov, Todor Stefanov, Ed F. Deprettere
TCS
2008
13 years 9 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini