Sciweavers

26 search results - page 4 / 6
» Approximation theorems for group valued functions
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
EUROCRYPT
1999
Springer
13 years 11 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold
ISCI
2008
96views more  ISCI 2008»
13 years 7 months ago
Fuzzy age-dependent replacement policy and SPSA algorithm based-on fuzzy simulation
An increase in the performance of deteriorating systems can be achieved through the adoption of suitable maintenance policies. One of the most popular maintenance policies is the ...
Jiashun Zhang, Ruiqing Zhao, Wansheng Tang
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 7 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan
JMLR
2006
153views more  JMLR 2006»
13 years 7 months ago
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
Jelle R. Kok, Nikos A. Vlassis