Sciweavers

45 search results - page 7 / 9
» Bounds for Real Roots and Applications to Orthogonal Polynom...
Sort
View
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
COLT
2007
Springer
14 years 2 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 15 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
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
14 years 1 months ago
RSA with Balanced Short Exponents and Its Application to Entity Authentication
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
Hung-Min Sun, Cheng-Ta Yang
EWSN
2009
Springer
14 years 9 months ago
Flow-Based Real-Time Communication in Multi-Channel Wireless Sensor Networks
As many radio chips used in today's sensor mote hardware can work at different frequencies, several multi-channel communication protocols have recently been proposed to improv...
Xiaodong Wang, Xiaorui Wang, Xing Fu, Guoliang Xin...