Sciweavers

429 search results - page 7 / 86
» Turing computations on ordinals
Sort
View
EUROGP
2008
Springer
135views Optimization» more  EUROGP 2008»
14 years 11 months ago
Using Genetic Programming for Turing Machine Induction
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
Amashini Naidoo, Nelishia Pillay
69
Voted
CORR
1999
Springer
93views Education» more  CORR 1999»
14 years 9 months ago
On the Power of Positive Turing Reductions
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
Edith Hemaspaandra
SAC
2010
ACM
15 years 4 months ago
Feature selection for ordinal regression
Ordinal regression (also known as ordinal classification) is a supervised learning task that consists of automatically determining the implied rating of a data item on a fixed, ...
Stefano Baccianella, Andrea Esuli, Fabrizio Sebast...
ENTCS
2011
131views more  ENTCS 2011»
14 years 4 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
Ed Blakey
NIPS
2001
14 years 11 months ago
The Fidelity of Local Ordinal Encoding
A key question in neuroscience is how to encode sensory stimuli such as images and sounds. Motivated by studies of response properties of neurons in the early cortical areas, we p...
Javid Sadr, Sayan Mukherjee, K. Thoresz, Pawan Sin...