Sciweavers

1070 search results - page 65 / 214
» Type Classes with Functional Dependencies
Sort
View
TIT
2008
103views more  TIT 2008»
13 years 7 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
FOCM
2011
117views more  FOCM 2011»
13 years 2 months ago
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
Folkmar Bornemann
ECML
1997
Springer
13 years 12 months ago
Constructing Intermediate Concepts by Decomposition of Real Functions
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
Janez Demsar, Blaz Zupan, Marko Bohanec, Ivan Brat...
EOR
2007
117views more  EOR 2007»
13 years 7 months ago
Simultaneous perturbation stochastic approximation of nonsmooth functions
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
Vaida Bartkute, Leonidas Sakalauskas
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 2 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...