Sciweavers

8824 search results - page 5 / 1765
» On the Complexity of Real Functions
Sort
View
ESANN
2008
13 years 9 months ago
A novel autoassociative memory on the complex hypercubic lattice
In this paper we have defined a novel activation function called the multi-level signum for the real and complex valued associative memories. The major motivation of such a functio...
Rama Murthy Garimella, Praveen Dasigi
ICPP
2002
IEEE
14 years 1 months ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
Jinggang Wang, Binoy Ravindran
ISSAC
2009
Springer
121views Mathematics» more  ISSAC 2009»
14 years 3 months ago
Faster real feasibility via circuit discriminants
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...
Frédéric Bihan, J. Maurice Rojas, Ca...
MCU
2004
76views Hardware» more  MCU 2004»
13 years 9 months ago
Real Recursive Functions and Real Extensions of Recursive Functions
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing...
Olivier Bournez, Emmanuel Hainry
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 14 days ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass