2938 search results - page 90 / 588 » On obfuscating point functions |
149
click to vote
CSFW
2008
IEEE
16 years 24 days ago
2008
IEEE
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
267
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
222
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
In this paper, we study the class of competitive equilibria in two sided matching markets with general (non-quasilinear) utility functions. Mechanism design in general non-quasili...
183
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
166
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...