Sciweavers

28888 search results - page 341 / 5778
» Computability and complexity in analysis
Sort
View
JIFS
2002
60views more  JIFS 2002»
15 years 6 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...
BMCBI
2008
132views more  BMCBI 2008»
15 years 6 months ago
Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
Raffaele Giancarlo, Davide Scaturro, Filippo Utro
FCCM
1999
IEEE
210views VLSI» more  FCCM 1999»
15 years 11 months ago
Algorithm Analysis and Mapping Environment for Adaptive Computing Systems: Further Results
Abstract We are developing an integrated algorithm analysis and mapping environment particularly tailored for signal processing applications on Adaptive Computing Systems ACS. Our ...
Eric K. Pauer, Paul D. Fiore, John M. Smith
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 6 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
DEDS
2006
78views more  DEDS 2006»
15 years 6 months ago
The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems
In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). ...
Yu-Chi Ho, Qing-Shan Jia, Qianchuan Zhao