Sciweavers

21 search results - page 4 / 5
» Search Techniques for Rational Polynomial Orders
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 2 months 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
JCB
2006
140views more  JCB 2006»
13 years 10 months ago
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
Eran Halperin, Elad Hazan
VTC
2006
IEEE
138views Communications» more  VTC 2006»
14 years 4 months ago
Transmit Precoding for the Multiple Antenna Broadcast Channel
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
Manish Airy, Sandeep Bhadra, Robert W. Heath Jr., ...
OPODIS
2003
14 years 3 days ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
RTSS
1992
IEEE
14 years 2 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin