Sciweavers

1414 search results - page 165 / 283
» Randomness and Universal Machines
Sort
View
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
16 years 3 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
ICPR
2008
IEEE
15 years 10 months ago
Detecting information-hiding in WAV audios
In this article, we propose a steganalysis method for detecting the presence of information-hiding behavior in wav audios. We extract the neighboring joint distribution features a...
Qingzhong Liu, Andrew H. Sung, Mengyu Qiao
157
Voted
AB
2008
Springer
15 years 9 months ago
On the Computational Power of Biochemistry
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
Luca Cardelli, Gianluigi Zavattaro
IJCNN
2007
IEEE
15 years 9 months ago
Upper Bound on Pattern Storage in Feedforward Networks
—Starting from the strict interpolation equations for multivariate polynomials, an upper bound is developed for the number of patterns that can be memorized by a nonlinear feedfo...
Pramod Lakshmi Narasimha, Michael T. Manry, Franci...
124
Voted
ESANN
2006
15 years 4 months ago
Using sampling methods to improve binding site predictions
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhors...